The Laplacian spectral radius of trees and maximum vertex degree

DOI10.1016/j.disc.2011.01.017zbMath1216.05013OpenAlexW2082467576MaRDI QIDQ533788

Yong-Cai Geng, Sumit K. Garg

Publication date: 6 May 2011

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

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

zbMATH Keywords

treemaximum degreeLaplacian spectral radius

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07)

Related Items (4)

Ordering \(Q\)-indices of graphs: given size and circumference ⋮ Ordering (signless) Laplacian spectral radii with maximum degrees of graphs ⋮ A note on (signless) Laplacian spectral ordering with maximum degrees of graphs ⋮ Minimal extremal graphs for addition of algebraic connectivity and independence number of connected graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On the ordering of trees by the Laplacian coefficients
• On the second Laplacian eigenvalues of trees of odd order
• Signless Laplacians of finite graphs
• The Laplacian spectral radii of trees with degree sequences
• Laplacian spectral radius of trees with given maximum degree
• Towards a spectral theory of graphs based on the signless Laplacian. II.
• The Laplacian spectral radius for unicyclic graphs with given independence number
• Trees with minimal Laplacian coefficients
• On the Laplacian spectral radii of trees
• A note on Laplacian graph eigenvalues
• Laplacian matrices of graphs: A survey
• On the Laplacian spectral radius of a tree.
• On the second largest Laplacian eigenvalue of trees
• Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
• The Laplacian Spectrum of a Graph
• Minimizing the Laplacian spectral radius of trees with given matching number

This page was built for publication: The Laplacian spectral radius of trees and maximum vertex degree