Sharp upper and lower bounds for the Laplacian spectral radius and the spectral radius of graphs

DOI10.1007/S10255-006-6106-2zbMath1144.05040OpenAlexW2396706119MaRDI QIDQ942884

Ji-Ming Guo

Publication date: 8 September 2008

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-006-6106-2

zbMATH Keywords

graphbipartite grapheigenvectorspectral radiusLaplacian spectral radiusupper (lower) bound

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (1)

Bounds for the Laplacian spectral radius of graphs

Cites Work

• Unnamed Item
• Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
• A bound on the spectral radius of graphs
• A note on Laplacian graph eigenvalues
• A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs.
• Two sharp upper bounds for the Laplacian eigenvalues.
• A sharp upper bound on the largest eigenvalue of the Laplacian matrix of a graph
• A new upper bound for the Laplacian spectral radius of graphs
• Some new bounds on the spectral radius of graphs
• On the spectral radius of graphs with cut vertices
• The Laplacian eigenvalues of mixed graphs
• Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
• Matrix Analysis
• Eigenvalues of the Laplacian of a graph^∗
• de Caen's inequality and bounds on the largest Laplacian eigenvalue of a graph

This page was built for publication: Sharp upper and lower bounds for the Laplacian spectral radius and the spectral radius of graphs