Sharp bound of the kth eigenvalue of trees

https://doi.org/10.1016/0012-365X(94)90104-XGet rights and content
Under an Elsevier user license
open archive

Abstract

The sharp lower bound of the kth largest positive eigenvalue of a tree T with n vertices, and the sharp lower bound of the positive eigenvalues of such a tree T are worked out in this study. A conjecture on the sharp bound of the kth eigenvalue of such a T is proved.

Cited by (0)