Back to Search
Start Over
A survey on spectral conditions for some extremal graph problems
- Source :
- Advances in Mathematics (China), 51 (2) (2022) 193-258
- Publication Year :
- 2021
-
Abstract
- This survey is two-fold. We first report new progress on the spectral extremal results on the Tur\'{a}n type problems in graph theory. More precisely, we shall summarize the spectral Tur\'{a}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 $\beta$-deficient.<br />Comment: This article is a survey paper and it is very long with 80 pages. In such survey, it is impossible to refer to all the nice papers. So if a paper is missing from this survey, which does not mean that it is not worth including it. Any suggestions and comments are welcome. E-mail: ytli0921@hnu.edu.cn
- Subjects :
- Mathematics - Combinatorics
Mathematics - Spectral Theory
05C50, 15A18, 05C38
Subjects
Details
- Database :
- arXiv
- Journal :
- Advances in Mathematics (China), 51 (2) (2022) 193-258
- Publication Type :
- Report
- Accession number :
- edsarx.2111.03309
- Document Type :
- Working Paper
- Full Text :
- https://doi.org/10.11845/sxjz.2021005a