Add to ORKGIn this paper we establish some upper bounds for the largest of min-imum degree eigenvalues and a lower bound for the largest of minimum degree eigenvalues of trees. Mathematics Subject Classification: 05C5
AbstractLet λk(T) be the kth eigenvalue of a tree, [x] the largest integer not greater than x. It is...
AbstractLet λ2 be the second largest eigenvalue of a graph. Powers (1988) [4] gave some upper bounds...
In this paper we introduce the concept of maximum degree matrix M(G) of a simple graph G and obtain ...
AbstractLet λ1(G) denote the largest eigenvalue of the adjacency matrix and let μ1(G) denote the lar...
AbstractAn upper bound for the largest eigenvalues of all but a few families of trees is given in th...
AbstractWe give an upper bound for the largest eigenvalue of a nonregular graph with n vertices and ...
We improve some recent results on graph eigenvalues. In particular, we prove that if G is a graph of...
We improve some recent results on graph eigenvalues. In particular, we prove that if G is a graph of...
AbstractThis paper is concerned with techniques for quantitative analysis of the largest p-Laplacian...
AbstractLet G be a simple graph with n vertices. The matrix L(G)=D(G)−A(G) is called the Laplacian o...
AbstractWe improve some recent results on graph eigenvalues. In particular, we prove that if G is a ...
AbstractThe sharp lower bound of the kth largest positive eigenvalue of a tree T with n vertices, an...
AbstractVery little is known about upper bounds for the largest eigenvalues of a tree that depend on...
AbstractLet G be a simple graph, its Laplacian matrix is the difference of the diagonal matrix of it...
AbstractUpper and lower estimates are found for the maximum of the kth eigenvalue of a graph as a fu...
AbstractLet λk(T) be the kth eigenvalue of a tree, [x] the largest integer not greater than x. It is...
AbstractLet λ2 be the second largest eigenvalue of a graph. Powers (1988) [4] gave some upper bounds...
In this paper we introduce the concept of maximum degree matrix M(G) of a simple graph G and obtain ...
AbstractLet λ1(G) denote the largest eigenvalue of the adjacency matrix and let μ1(G) denote the lar...
AbstractAn upper bound for the largest eigenvalues of all but a few families of trees is given in th...
AbstractWe give an upper bound for the largest eigenvalue of a nonregular graph with n vertices and ...
We improve some recent results on graph eigenvalues. In particular, we prove that if G is a graph of...
We improve some recent results on graph eigenvalues. In particular, we prove that if G is a graph of...
AbstractThis paper is concerned with techniques for quantitative analysis of the largest p-Laplacian...
AbstractLet G be a simple graph with n vertices. The matrix L(G)=D(G)−A(G) is called the Laplacian o...
AbstractWe improve some recent results on graph eigenvalues. In particular, we prove that if G is a ...
AbstractThe sharp lower bound of the kth largest positive eigenvalue of a tree T with n vertices, an...
AbstractVery little is known about upper bounds for the largest eigenvalues of a tree that depend on...
AbstractLet G be a simple graph, its Laplacian matrix is the difference of the diagonal matrix of it...
AbstractUpper and lower estimates are found for the maximum of the kth eigenvalue of a graph as a fu...
AbstractLet λk(T) be the kth eigenvalue of a tree, [x] the largest integer not greater than x. It is...
AbstractLet λ2 be the second largest eigenvalue of a graph. Powers (1988) [4] gave some upper bounds...
In this paper we introduce the concept of maximum degree matrix M(G) of a simple graph G and obtain ...