Upper bounds on the spectral radius of book-free and/or K₂,l-free graphs

DOI10.1016/J.LAA.2006.08.007zbMATH Open1109.05075OpenAlexW1976471160MaRDI QIDQ861014FDOQ861014

Authors: Zhipeng Song, Lingsheng 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

Recommendations

• Upper bounds on Q-spectral radius of book-free and/or \(K_{s,t}\)-free graphs
• Bounds on graph eigenvalues. II
• A note on the bounds for the spectral radius of graphs
• Sharp upper bounds on the spectral radius of graphs
• A sharp upper bound of the spectral radius of graphs

zbMATH Keywords

strongly regular graphgirth

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (14)

• A bound on the Laplacian spread which is tight for strongly regular graphs
• The spectral radius of graphs with no odd wheels
• On the spectral radius of graphs without a star forest
• The maximum spectral radius of wheel-free graphs
• A Spectral Erdős-Sós Theorem
• The spectral even cycle problem
• A characterization of strongly regular graphs in terms of the largest signless Laplacian eigenvalues
• Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs
• Upper bounds on Q-spectral radius of book-free and/or \(K_{s,t}\)-free graphs
• Spectral Turán problems for intersecting even cycles
• A sharp upper bound on the spectral radius of \(C_5\)-free/\(C_6\)-free graphs with given size
• The spectral Turán problem about graphs with no 6-cycle
• Spectral extrema of graphs: forbidden hexagon
• Bounds on graph eigenvalues. II

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q861014)