Several sharp upper bounds for the largest Laplacian eigenvalue of a graph

DOI10.1007/s11425-007-0126-0zbMath1134.05064MaRDI QIDQ2475324

Tian-fei Wang

Publication date: 11 March 2008

Published in: Science in China. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-007-0126-0

zbMATH Keywords

upper bound; extremal graphs; Laplacian matrix; the largest eigenvalue; similar matrix

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

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

Related Items

Bounds for the Laplacian spectral radius of graphs, Some upper bounds for the signless Laplacian spectral radius of digraphs, Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian

Cites Work

• Unnamed Item
• A note on Laplacian graph eigenvalues
• On the Laplacian eigenvalues of a graph
• Laplacian matrices of graphs: A survey
• A new upper bound for eigenvalues of the Laplacian matrix of a graph
• An improved upper bound for 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.
• An always nontrivial upper bound for Laplacian graph 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
• A simplified Brauer's theorem on matrix eigenvalues
• Sharp upper bounds for the Laplacian graph eigenvalues
• de Caen's inequality and bounds on the largest Laplacian eigenvalue of a graph