Bounding the largest eigenvalue of trees in terms of the largest vertex degree

DOI10.1016/S0024-3795(02)00442-1zbMath1028.05062MaRDI QIDQ1863520

Dragan Stevanović

Publication date: 11 March 2003

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

Full work available at URL: https://doi.org/10.1016/s0024-3795(02)00442-1

zbMATH Keywords

tree; largest eigenvalue; Laplacian matrix; adajancy matrix

Mathematics Subject Classification ID

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

Related Items

Bounds for the Laplacian spectral radius of graphs, On the α-spectral radius of graphs, Ordering trees by their largest eigenvalues, On the \(A_{\alpha}\)-spectra of trees, Resolution of AutoGraphiX conjectures relating the index and matching number of graphs, Largest \(H\)-eigenvalue of uniform \(s\)-hypertrees, Majorization and the spectral radius of starlike trees, On the spectral radius of trees with fixed diameter, The spectra of some trees and bounds for the largest eigenvalue of any tree, The largest eigenvalue of unicyclic graphs, The Laplacian spectral radii of trees with degree sequences, Laplacian spectral radius of trees with given maximum degree, The least eigenvalue of graphs with given connectivity, Matrix norms and rapid mixing for spin systems, Strong-coupling scales and the graph structure of multi-gravity theories, On the eigenvalues and spectral radius of starlike trees, A relation between the signless Laplacian spectral radius of complete multipartite graphs and majorization, Sharp lower bounds on the Laplacian eigenvalues of trees, Mysteries around the graph Laplacian eigenvalue 4, On the location of zeros of the Laplacian matching polynomials of graphs, Laplacian matching polynomial of graphs, An explicit formula for eigenvalues of Bethe trees and upper bounds on the largest eigenvalue of any tree, New upper bounds on the spectral radius of trees with the given number of vertices and maximum degree, Cored hypergraphs, power hypergraphs and their Laplacian H-eigenvalues, New upper bounds on the spectral radius of unicyclic graphs, Ordering trees by their Laplacian spectral radii, Improved bounds for the largest eigenvalue of trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Laplacian matrices of graphs: A survey
• A sharp upper bound on the largest eigenvalue of the Laplacian matrix of a graph
• Theory of monomer-dimer systems
• On the eigenvalues of trees
• Eigenvalues of the Laplacian of a graph^∗
• The Laplacian Spectrum of a Graph II
• The largest eigenvalue of a graph: A survey