A survey on spectral conditions for some extremal graph problems

This survey is two-fold. We first report new progress on the spectral extremal results on the Turán type problems in graph theory. More precisely, we shall summarize the spectral Turán function in terms of the adjacency spectral radius and the signless Laplacian spectral radius for various graphs. For instance, the complete graphs, general graphs with chromatic number at least three, complete bipartite graphs, odd cycles, even cycles, color-critical graphs and intersecting triangles. The second goal is to conclude some recent results of the spectral conditions on some graphical properties. By a unified method, we present some sufficient conditions based on the adjacency spectral radius and the signless Laplacian spectral radius for a graph to be Hamiltonian, $k$-Hamiltonian, $k$-edge-Hamiltonian, traceable, $k$-path-coverable, $k$-connected, $k$-edge-connected, Hamilton-connected, perfect matching and $β$-deficient.

No reviews yet.

No comments yet.