Spectral extremal results on trees

DOI10.37236/12726zbMath1543.05112MaRDI QIDQ6574373

Longfei Fang, Zhiyuan Zhang, Huiqiu Lin, Jin-Long Shu

Publication date: 18 July 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

spectral radiusTurán-type problemBrualdi-Solheid problem

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites Work

• The Erdős-Sós conjecture for spiders of four legs
• The Erdős-Sós conjecture for spiders of large size
• Proof of a conjecture on the spectral radius of \(C_4\)-free graphs
• Spectral extrema of graphs: forbidden hexagon
• The spectral radius of graphs without paths and cycles of specified length
• Spectral bounds for the clique and independence numbers of graphs
• The Colin de Verdière parameter, excluded minors, and the spectral radius
• The maximum spectral radius of non-bipartite graphs forbidding short odd cycles
• Spectral extremal graphs for intersecting cliques
• The spectral radius of graphs with no intersecting odd cycles
• The spectral radius of graphs with no odd wheels
• Three conjectures in extremal spectral graph theory
• Bounds on graph eigenvalues. II
• The Erdős-Sós conjecture for spiders
• A spectral condition for odd cycles in graphs
• The maximum spectral radius of wheel-free graphs
• On a conjecture of Nikiforov involving a spectral radius condition for a graph to contain all trees
• On a conjecture of spectral extremal problems
• Spectral radius conditions for the existence of all subtrees of diameter at most four
• [https://portal.mardi4nfdi.de/wiki/Publication:4865531 On the Erd�s-S�s conjecture]
• The spectral radius of graphs without trees of diameter at most four
• Eigenvalues and triangles in graphs
• A Spectral Erdős-Sós Theorem
• A complete solution to the Cvetković–Rowlinson conjecture

This page was built for publication: Spectral extremal results on trees