Upper bounds on the smallest positive eigenvalue of trees

DOI10.1007/s00026-022-00619-xOpenAlexW4308627587MaRDI QIDQ2694453

Sonu Rani, Sasmita Barik

Publication date: 3 April 2023

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00026-022-00619-x

zbMATH Keywords

treeadjacency matrixsmallest positive eigenvalue

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Topological approach to the chemistry of conjugated molecules
• On the two largest eigenvalues of trees
• On alternating paths and the smallest positive eigenvalue of trees
• The largest eigenvalue of a graph: A survey

This page was built for publication: Upper bounds on the smallest positive eigenvalue of trees