The Laplacian spectral radii of trees with degree sequences

DOI10.1016/j.disc.2007.06.017zbMath1156.05038MaRDI QIDQ932582

Xiao Dong Zhang

Publication date: 11 July 2008

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

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

zbMATH Keywords

tree; majorization; degree sequence; Laplacian spectral radius

Mathematics Subject Classification ID

05C05: Trees

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

15B48: Positive matrices and their generalizations; cones of matrices

Related Items

The Number of Subtrees of Trees with Given Degree Sequence, Laplacian spectral radius and maximum degree of trees with perfect matchings, New method and new results on the order of spectral radius, The Laplacian spectral radius of trees and maximum vertex degree, The signless Laplacian spectral radius of tricyclic graphs and trees with \(k\) pendant vertices, On the Laplacian spectral radii of bipartite graphs, On the index of necklaces, The signless Laplacian spectral radius of bicyclic graphs with prescribed degree sequences, On the spectral radii and the signless Laplacian spectral radii of c-cyclic graphs with fixed maximum degree, Semiregular trees with minimal Laplacian spectral radius, The signless Laplacian spectral radius of graphs with given degree sequences, On the weighted trees with given degree sequence and positive weight set, The Laplacian spectral radius of some graphs, The majorization theorem of connected graphs, The majorization theorem for signless Laplacian spectral radii of connected graphs, The (signless) Laplacian spectral radius of unicyclic and bicyclic graphs with n vertices and k pendant vertices, TWO SHARP UPPER BOUNDS FOR THE SIGNLESS LAPLACIAN SPECTRAL RADIUS OF GRAPHS, A further result on majorization theorem, Faber–Krahn type inequality for unicyclic graphs, The first Dirichlet eigenvalue of bicyclic graphs

Cites Work

• The Laplacian spectrum of a mixed graph
• Laplacian matrices of graphs: A survey
• A new upper bound for eigenvalues of the Laplacian matrix of a graph
• On the Laplacian spectral radius of a tree.
• A sharp upper bound on the largest eigenvalue of the Laplacian matrix of a graph
• On the two conjectures of Graffiti
• Bounding the largest eigenvalue of trees in terms of the largest vertex degree
• Improved bounds for the largest eigenvalue of trees
• The Laplacian Spectrum of a Graph
• Eigenvalues of the Laplacian of a graph^∗
• The Laplacian Spectrum of a Graph II
• Unnamed Item