The spectral Turán problem about graphs with no 6-cycle
From MaRDI portal
Publication:2174481
DOI10.1016/j.laa.2019.12.032zbMath1437.05160OpenAlexW2998040610MaRDI QIDQ2174481
Bing Wang, Longfei Fang, Ming-qing Zhai
Publication date: 21 April 2020
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2019.12.032
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (10)
The maximum spectral radius of wheel-free graphs ⋮ A Spectral Erdős-Sós Theorem ⋮ The maximum spectral radius of graphs without spanning linear forests ⋮ Spectral extremal graphs for disjoint cliques ⋮ Spectral Turán problems for intersecting even cycles ⋮ The spectral radius of graphs with no odd wheels ⋮ The sharp upper bounds on the \(A_{\alpha}\)-spectral radius of \(C_4\)-free graphs and Halin graphs ⋮ Ordering graphs with given size by their signless Laplacian spectral radii ⋮ Spectral radius and the 2-power of Hamilton cycle ⋮ The spectral radius and \({\mathcal{P}}_{\ge \ell}\)-factors of graphs involving minimum degree
Cites Work
- Unnamed Item
- Unnamed Item
- Proof of a conjecture on the spectral radius of \(C_4\)-free graphs
- A contribution to the Zarankiewicz problem
- Upper bounds on the spectral radius of book-free and/or \(K_{2,l}\)-free graphs
- The spectral radius of graphs without paths and cycles of specified length
- Spectral extremal results with forbidding linear forests
- The spectral radius of graphs without long cycles
- A new upper bound for the spectral radius of graphs with girth at least 5
- Bounds on graph eigenvalues. II
- A spectral condition for odd cycles in graphs
- Some new results in extremal graph theory
- The History of Degenerate (Bipartite) Extremal Graph Problems
This page was built for publication: The spectral Turán problem about graphs with no 6-cycle
