Add to ORKGAbstract. It is shown that among all trees with a fixed number of vertices the path has the smallest value of the greatest Laplacian eigenvalue
Abstract. Let mT [0, 2) be the number of Laplacian eigenvalues of a tree T in [0, 2), multiplicities...
Let G be a simple graph with n vertices and let µ1> µ2>...> µn−1> µn = 0 be the eigenval...
AbstractThis paper is concerned with techniques for quantitative analysis of the largest p-Laplacian...
The Laplacian spread of a graph is defined to be the difference between the largest eigenvalue and t...
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...
AbstractLet Tnc be the set of the complements of trees on n vertices. In this paper we characterize ...
Graphs and AlgorithmsThe Laplacian spread of a graph is defined to be the difference between the lar...
AbstractLet G be a simple graph, its Laplacian matrix is the difference of the diagonal matrix of it...
AbstractThe sharp lower bound of the kth largest positive eigenvalue of a tree T with n vertices, an...
Trees that have greatest maximum p-Laplacian eigenvalue among all trees with a given degree sequence...
AbstractLet Tnc be the set of the complements of trees of order n. In this paper, we characterize th...
this paper we consider methods based on graph embeddings for estimating the smallest nontrivial eige...
AbstractLet Tn+ be the set of all trees of order n with perfect matchings. In this paper, we prove t...
Abstract. Let mT [0, 2) be the number of Laplacian eigenvalues of a tree T in [0, 2), multiplicities...
Abstract. Let mT [0, 2) be the number of Laplacian eigenvalues of a tree T in [0, 2), multiplicities...
Let G be a simple graph with n vertices and let µ1> µ2>...> µn−1> µn = 0 be the eigenval...
AbstractThis paper is concerned with techniques for quantitative analysis of the largest p-Laplacian...
The Laplacian spread of a graph is defined to be the difference between the largest eigenvalue and t...
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...
AbstractLet Tnc be the set of the complements of trees on n vertices. In this paper we characterize ...
Graphs and AlgorithmsThe Laplacian spread of a graph is defined to be the difference between the lar...
AbstractLet G be a simple graph, its Laplacian matrix is the difference of the diagonal matrix of it...
AbstractThe sharp lower bound of the kth largest positive eigenvalue of a tree T with n vertices, an...
Trees that have greatest maximum p-Laplacian eigenvalue among all trees with a given degree sequence...
AbstractLet Tnc be the set of the complements of trees of order n. In this paper, we characterize th...
this paper we consider methods based on graph embeddings for estimating the smallest nontrivial eige...
AbstractLet Tn+ be the set of all trees of order n with perfect matchings. In this paper, we prove t...
Abstract. Let mT [0, 2) be the number of Laplacian eigenvalues of a tree T in [0, 2), multiplicities...
Abstract. Let mT [0, 2) be the number of Laplacian eigenvalues of a tree T in [0, 2), multiplicities...
Let G be a simple graph with n vertices and let µ1> µ2>...> µn−1> µn = 0 be the eigenval...
AbstractThis paper is concerned with techniques for quantitative analysis of the largest p-Laplacian...