Upper bounds on the smallest positive eigenvalue of trees with at most one zero eigenvalue

DOI10.1016/j.laa.2022.11.013OpenAlexW4310291842MaRDI QIDQ2109070

Sonu Rani

Publication date: 20 December 2022

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

Full work available at URL: https://doi.org/10.1016/j.laa.2022.11.013

zbMATH Keywords

adjacency matrixtreessmallest positive eigenvalue

Mathematics Subject Classification ID

Trees (05C05) 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
• Topological approach to the chemistry of conjugated molecules
• Sharp bound of the \(k\)th eigenvalue of trees
• On the two largest eigenvalues of trees
• Minimizing algebraic connectivity over connected graphs with fixed girth
• The smallest values of algebraic connectivity for trees
• On nonsingular trees and a reciprocal eigenvalue property
• The Spectrum of the Corona of Two Graphs
• Ordering trees by their largest eigenvalues

This page was built for publication: Upper bounds on the smallest positive eigenvalue of trees with at most one zero eigenvalue