Department of Mathematics
A note on the upper bounds for the Laplacian spectral radius of graphs
Let G be a simple graph with n vertices, m edges. If each edge of G belongs to t triangles (t≥1), then we present a new upper bound for the Laplacian spectral radius of G which improves some known upper bounds. © 2013 Elsevier Inc. All rights reserved.
Eigenvector, Graph, Laplacian spectral radius, Upper bound
Source Publication Title
Linear Algebra and its Applications
Guo, Ji-Ming, Jianxi Li, and Wai Chee Shiu. "A note on the upper bounds for the Laplacian spectral radius of graphs." Linear Algebra and its Applications 439.6 (2013): 1657-1661.