Upper bounds on the spectral radius of book-free and/or \(K_{2,l}\)-free graphs

DOI10.1016/j.laa.2006.08.007zbMath1109.05075OpenAlexW1976471160MaRDI QIDQ861014

Zhipeng Song, Ling-Sheng Shi

Publication date: 9 January 2007

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2006.08.007

zbMATH Keywords

strongly regular graphgirth

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42)

Related Items (9)

The maximum spectral radius of wheel-free graphs ⋮ The spectral Turán problem about graphs with no 6-cycle ⋮ A Spectral Erdős-Sós Theorem ⋮ Spectral Turán problems for intersecting even cycles ⋮ Bounds on graph eigenvalues. II ⋮ The spectral radius of graphs with no odd wheels ⋮ A characterization of strongly regular graphs in terms of the largest signless Laplacian eigenvalues ⋮ Spectral extrema of graphs: forbidden hexagon ⋮ A bound on the Laplacian spread which is tight for strongly regular graphs

Cites Work

• Walks and the spectral radius of graphs
• The spectral radii of a graph and its line graph
• Bounds on eigenvalues and chromatic numbers
• Sharp upper bounds on the spectral radius of graphs
• A sharp upper bound of the spectral radius of graphs
• On the spectral radius of graphs with cut vertices
• A new upper bound for the spectral radius of graphs with girth at least 5

This page was built for publication: Upper bounds on the spectral radius of book-free and/or \(K_{2,l}\)-free graphs