Laplacian spectral radius of trees with given maximum degree

DOI10.1016/j.laa.2008.05.028zbMath1144.05324OpenAlexW2055132311MaRDI QIDQ947660

Mei Lu, Ai-Mei Yu

Publication date: 6 October 2008

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2008.05.028

zbMATH Keywords

treemaximum degreeLaplacian spectral radiuslocal switching

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items

Laplacian spectral radius and maximum degree of trees with perfect matchings ⋮ New upper bounds on the spectral radius of trees with the given number of vertices and maximum degree ⋮ Note on the \(k\)th Laplacian eigenvalues of trees with perfect matchings ⋮ The Laplacian spectral radius of trees and maximum vertex degree ⋮ On the Laplacian spectral radii of bipartite graphs ⋮ The Laplacian spectral radius of bicyclic graphs with a given girth ⋮ The Laplacian spectral radius of some graphs ⋮ Maximizing the signless Laplacian spectral radius of graphs with given diameter or cut vertices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The effect on the Laplacian spectral radius of a graph by adding or grafting edges
• On the Laplacian spectral radius of trees with fixed diameter
• Laplacian matrices of graphs: A survey
• On the Laplacian spectral radius of a tree.
• Bounding the largest eigenvalue of trees in terms of the largest vertex degree
• Improved bounds for the largest eigenvalue of trees
• Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees