AbstractThe 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
AbstractWe consider the only remaining unsolved case n≡0 (mod k) for the largest kth eigenvalue λk.o...
Let T be a tree of order n>6 with μ as a positive eigenvalue of multiplicity k. Star complemen...
AbstractWe consider the only remaining unsolved case n≡0 (mod k) for the largest kth eigenvalue λk.o...
AbstractThe sharp lower bound of the kth largest positive eigenvalue of a tree T with n vertices, an...
AbstractWe prove the upper bound λk(T) ⩽ √[n / k] – 1 for the kth largest eigenvalue of a tree T (1 ...
AbstractLet λk(F) be the kth largest eigenvalue of a forest F, and λ(F) be the smallest positive eig...
AbstractVery little is known about upper bounds for the largest eigenvalues of a tree that depend on...
AbstractVery little is known about upper bound for the largest eigenvalue of a tree with a given siz...
AbstractWe consider the only remaining unsolved case n ≡ 0(mod k) for the largest kth eigenvalue of ...
AbstractIn [Linear Algebra Appl. 149 (1991) 19–34], Shao proved that for a tree T on n vertices, the...
AbstractWe prove the upper bound λk(T) ⩽ √[n / k] – 1 for the kth largest eigenvalue of a tree T (1 ...
AbstractThe set of trees with n vertices and the set of trees with perfect matchings are denoted by ...
AbstractWe consider the only remaining unsolved case n≡0 (mod k) for the largest kth eigenvalue of t...
AbstractUpper and lower estimates are found for the maximum of the kth eigenvalue of a graph as a fu...
AbstractVery little is known about upper bounds for the largest eigenvalues of a tree that depend on...
AbstractWe consider the only remaining unsolved case n≡0 (mod k) for the largest kth eigenvalue λk.o...
Let T be a tree of order n>6 with μ as a positive eigenvalue of multiplicity k. Star complemen...
AbstractWe consider the only remaining unsolved case n≡0 (mod k) for the largest kth eigenvalue λk.o...
AbstractThe sharp lower bound of the kth largest positive eigenvalue of a tree T with n vertices, an...
AbstractWe prove the upper bound λk(T) ⩽ √[n / k] – 1 for the kth largest eigenvalue of a tree T (1 ...
AbstractLet λk(F) be the kth largest eigenvalue of a forest F, and λ(F) be the smallest positive eig...
AbstractVery little is known about upper bounds for the largest eigenvalues of a tree that depend on...
AbstractVery little is known about upper bound for the largest eigenvalue of a tree with a given siz...
AbstractWe consider the only remaining unsolved case n ≡ 0(mod k) for the largest kth eigenvalue of ...
AbstractIn [Linear Algebra Appl. 149 (1991) 19–34], Shao proved that for a tree T on n vertices, the...
AbstractWe prove the upper bound λk(T) ⩽ √[n / k] – 1 for the kth largest eigenvalue of a tree T (1 ...
AbstractThe set of trees with n vertices and the set of trees with perfect matchings are denoted by ...
AbstractWe consider the only remaining unsolved case n≡0 (mod k) for the largest kth eigenvalue of t...
AbstractUpper and lower estimates are found for the maximum of the kth eigenvalue of a graph as a fu...
AbstractVery little is known about upper bounds for the largest eigenvalues of a tree that depend on...
AbstractWe consider the only remaining unsolved case n≡0 (mod k) for the largest kth eigenvalue λk.o...
Let T be a tree of order n>6 with μ as a positive eigenvalue of multiplicity k. Star complemen...
AbstractWe consider the only remaining unsolved case n≡0 (mod k) for the largest kth eigenvalue λk.o...
DOI
Add to ORKG