On an upper bound of the spectral radius of graphs

DOI10.1016/j.disc.2007.09.049zbMath1180.05064OpenAlexW2080204253MaRDI QIDQ998412

Bo Lian Liu

Publication date: 28 January 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.09.049

zbMATH Keywords

upper boundspectral radius

Mathematics Subject Classification ID

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

Related Items (4)

The greedy strategy for optimizing the Perron eigenvalue ⋮ On bounds for the index of double nested graphs ⋮ Some spectral properties of the non-backtracking matrix of a graph ⋮ Spectral simplex method

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the spectral radius of (0,1)-matrices
• Bounds on eigenvalues and chromatic numbers
• Sharp upper bounds on the spectral radius of graphs
• The spectral radius of graphs on surfaces
• Some new bounds on the spectral radius of graphs
• A sharp upper bound of the spectral radius of graphs

This page was built for publication: On an upper bound of the spectral radius of graphs