An improved upper bound for the Laplacian spectral radius of graphs

DOI10.1016/j.disc.2009.06.012zbMath1201.05059OpenAlexW2058759315MaRDI QIDQ1045030

Feng Tian, Huiqing Liu, Mei Lu

Publication date: 15 December 2009

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

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

zbMATH Keywords

graphmaximum and minimum degreeLaplacian spectral radius

Mathematics Subject Classification ID

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

Related Items (3)

A note on the upper bounds for the Laplacian spectral radius of graphs ⋮ Bounds for the Laplacian spectral radius of graphs ⋮ Bounds on normalized Laplacian eigenvalues of graphs

Cites Work

• A note on Laplacian graph eigenvalues
• On the Laplacian eigenvalues of a graph
• A new upper bound for eigenvalues of the Laplacian matrix of a graph
• On the Laplacian spectral radius of a graph
• An always nontrivial upper bound for Laplacian graph eigenvalues
• A sharp upper bound on the largest eigenvalue of the Laplacian matrix of a graph
• The Laplacian eigenvalues of mixed graphs
• 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: An improved upper bound for the Laplacian spectral radius of graphs