Name
Abstract | ||
|---|---|---|
To determine the Turán numbers of even cycles is a central problem of extremal graph theory. Even for C6, the Turán number is still open. Till now, the best known upper bound is given by Füredi, Naor and Verstraëte [On the Turán number for the hexagon, Advances in Math.]. In 2010, Nikiforov posed a spectral version of extremal graph theory problem: what is the maximum spectral radius ρ of an H-free graph of order n? Let exsp(n,H)=max{ρ(G)||V(G)|=n,H⊈G}. In contrast to the unsolved problem of Turán number of C6, we obtain the exact value of exsp(n,C6) and characterize the unique extremal graph. The result also confirms Nikiforov’s conjecture [The spectral radius of graphs without paths and cycles of specified length, Linear Algebra Appl.] for k=2. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.disc.2020.112028 | Discrete Mathematics |
Keywords | DocType | Volume |
Path,Cycle,Spectral radius,Adjacency matrix,Hexagon | Journal | 343 |
Issue | ISSN | Citations |
10 | 0012-365X | 1 |
PageRank | References | Authors |
0.37 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mingqing Zhai | 1 | 18 | 6.26 |
| Huiqiu Lin | 2 | 34 | 11.56 |