Bounds on the second largest eigenvalue of a tree with perfect matchings

DOI10.1016/S0024-3795(98)10107-6zbMath0931.05049OpenAlexW3140081794MaRDI QIDQ1124746

Chang An

Publication date: 28 November 1999

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

Full work available at URL: https://doi.org/10.1016/s0024-3795(98)10107-6

zbMATH Keywords

treeeigenvalueboundperfect matchings

Mathematics Subject Classification ID

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

Related Items (6)

Bounds on the largest eigenvalues of trees with a given size of matching ⋮ The maximum \(A_\alpha\)-spectral radius of \(t\)-connected graphs with bounded matching number ⋮ On a conjecture for the signless Laplacian spectral radius of cacti with given matching number ⋮ A note on the second largest eigenvalue of a tree with perfect matchings. ⋮ Perfect matching and distance spectral radius in graphs and bipartite graphs ⋮ A conjecture on the second largest eigenvalue of a tree with perfect matchings

Cites Work

• Inverses of trees
• Sharp lower bounds on the eigenvalues of trees
• The second largest eigenvalue of a tree
• Bounds on the \(k\)th eigenvalues of trees and forests

This page was built for publication: Bounds on the second largest eigenvalue of a tree with perfect matchings