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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have