Ordering trees by their largest eigenvalues

DOI10.1016/S0024-3795(03)00384-7zbMath1030.05029MaRDI QIDQ5906986

Qiong Xiang Huang, An Chang

Publication date: 25 August 2003

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

zbMATH Keywords

treeeigenvalueupper boundcharacteristic polynomial

Mathematics Subject Classification ID

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

Related Items (20)

A note on the multiplicities of the eigenvalues of a tree ⋮ More on the Estrada indices of trees ⋮ Ordering \(Q\)-indices of graphs: given size and circumference ⋮ The A_α-spectral radius of dense graphs ⋮ The maximum \(\alpha \)-spectral radius and the majorization theorem of \(k\)-uniform supertrees ⋮ Ordering trees by \(\alpha\)-index ⋮ Reciprocal distance Laplacian spectral properties double stars and their complements ⋮ Absolute algebraic connectivity of double brooms and trees ⋮ Arithmetic-geometric matrix of graphs and its applications ⋮ On extremality of ABC spectral radius of a tree ⋮ Ordering trees by their largest eigenvalues ⋮ A note on (signless) Laplacian spectral ordering with maximum degrees of graphs ⋮ Ordering trees and graphs with few cycles by algebraic connectivity ⋮ On the largest eigenvalues of trees with perfect matchings ⋮ On the spectral radii and the signless Laplacian spectral radii of c-cyclic graphs with fixed maximum degree ⋮ Ordering uniform supertrees by their spectral radii ⋮ Ordering of some uniform supertrees with larger spectral radii ⋮ Bounds on the ABC spectral radius of a tree ⋮ The multiplicity of eigenvalues of trees ⋮ On the spectral radius of trees with fixed diameter

Cites Work

• The second largest eigenvalue of a tree
• Bounds on the \(k\)th eigenvalues of trees and forests
• On the two largest eigenvalues of trees
• On the largest eigenvalue of a tree with perfect matchings
• On the spectral radius of trees

This page was built for publication: Ordering trees by their largest eigenvalues