AbstractVery little is known about upper bound for the largest eigenvalue of a tree with a given size of matching. In this paper, we find some upper bounds for the largest eigenvalue of a tree in terms of the number of vertices and the size of matchings, which improve some known results
AbstractWe prove the upper bound λk(T) ⩽ √[n / k] – 1 for the kth largest eigenvalue of a tree T (1 ...
AbstractLet Tn+ be the set of all trees of order n with perfect matchings. In this paper, we prove t...
AbstractVery little is known about lower bounds and upper bounds for the second largest Laplacian ei...
AbstractVery little is known about upper bounds for the largest eigenvalues of a tree that depend on...
AbstractThe set of trees with n vertices and the set of trees with perfect matchings are denoted by ...
AbstractIn this paper, we investigated a conjecture [Linear Algebra Appl. 283 (1998) 247] about the ...
AbstractIn this paper, an upper bound and a tight lower bound for the second largest eigenvalue of a...
AbstractVery little is known about upper bounds for the largest eigenvalues of a tree that depend on...
AbstractThe sharp lower bound of the kth largest positive eigenvalue of a tree T with n vertices, an...
AbstractDenote by Tn,q the set of trees with n vertices and matching number q. Guo [On the Laplacian...
AbstractVery little is known about lower bounds and upper bounds for the second largest Laplacian ei...
AbstractIn this paper, we present an upper bound for the second largest eigenvalue of a tree on n=2k...
AbstractThe set of trees with n vertices and the set of trees with perfect matchings are denoted by ...
AbstractAn upper bound for the largest eigenvalues of all but a few families of trees is given in th...
AbstractLet λk(F) be the kth largest eigenvalue of a forest F, and λ(F) be the smallest positive eig...
AbstractWe prove the upper bound λk(T) ⩽ √[n / k] – 1 for the kth largest eigenvalue of a tree T (1 ...
AbstractLet Tn+ be the set of all trees of order n with perfect matchings. In this paper, we prove t...
AbstractVery little is known about lower bounds and upper bounds for the second largest Laplacian ei...
AbstractVery little is known about upper bounds for the largest eigenvalues of a tree that depend on...
AbstractThe set of trees with n vertices and the set of trees with perfect matchings are denoted by ...
AbstractIn this paper, we investigated a conjecture [Linear Algebra Appl. 283 (1998) 247] about the ...
AbstractIn this paper, an upper bound and a tight lower bound for the second largest eigenvalue of a...
AbstractVery little is known about upper bounds for the largest eigenvalues of a tree that depend on...
AbstractThe sharp lower bound of the kth largest positive eigenvalue of a tree T with n vertices, an...
AbstractDenote by Tn,q the set of trees with n vertices and matching number q. Guo [On the Laplacian...
AbstractVery little is known about lower bounds and upper bounds for the second largest Laplacian ei...
AbstractIn this paper, we present an upper bound for the second largest eigenvalue of a tree on n=2k...
AbstractThe set of trees with n vertices and the set of trees with perfect matchings are denoted by ...
AbstractAn upper bound for the largest eigenvalues of all but a few families of trees is given in th...
AbstractLet λk(F) be the kth largest eigenvalue of a forest F, and λ(F) be the smallest positive eig...
AbstractWe prove the upper bound λk(T) ⩽ √[n / k] – 1 for the kth largest eigenvalue of a tree T (1 ...
AbstractLet Tn+ be the set of all trees of order n with perfect matchings. In this paper, we prove t...
AbstractVery little is known about lower bounds and upper bounds for the second largest Laplacian ei...
DOI
Add to ORKG