DOIAbstract
AbstractWe give an upper bound for the largest eigenvalue of a nonregular graph with n vertices and the largest vertex degree Δ
AbstractWe give an upper bound for the largest eigenvalue of a nonregular graph with n vertices and the largest vertex degree Δ
AbstractSeveral upper bounds on the largest Laplacian eigenvalue of a graph G, in terms of degree an...
AbstractThis paper is concerned with techniques for quantitative analysis of the largest p-Laplacian...
AbstractIn this paper we determine the extremal graphs for which equality in de Caen's inequality ho...
A novel method, based on the topology of the cardinal vertex, is described to find an upper bound fo...
In this paper we establish some upper bounds for the largest of min-imum degree eigenvalues and a lo...
AbstractLet G be a graph on vertex set V=v1,v2,…,vn. Let di be the degree of vi, let Ni be the set o...
AbstractLet G be a simple graph with n vertices. The matrix L(G)=D(G)−A(G) is called the Laplacian o...
AbstractLet λ1(G) denote the largest eigenvalue of the adjacency matrix and let μ1(G) denote the lar...
Let λ1 be the greatest eigenvalue and λn the least eigenvalue of the adjacency matrix of a connected...
AbstractUpper and lower estimates are found for the maximum of the kth eigenvalue of a graph as a fu...
Let λ1 be the greatest eigenvalue and λn the least eigenvalue of the adjacency matrix of a connected...
AbstractLet G be a simple graph. Let λ1(G) and μ1(G) denote the largest eigenvalue of the adjacency ...
AbstractWe first give a result on eigenvalues of the line graph of a graph. We then use the result t...
AbstractWe improve some recent results on graph eigenvalues. In particular, we prove that if G is a ...
AbstractAn upper bound for the largest eigenvalues of all but a few families of trees is given in th...
AbstractSeveral upper bounds on the largest Laplacian eigenvalue of a graph G, in terms of degree an...
AbstractThis paper is concerned with techniques for quantitative analysis of the largest p-Laplacian...
AbstractIn this paper we determine the extremal graphs for which equality in de Caen's inequality ho...
A novel method, based on the topology of the cardinal vertex, is described to find an upper bound fo...
In this paper we establish some upper bounds for the largest of min-imum degree eigenvalues and a lo...
AbstractLet G be a graph on vertex set V=v1,v2,…,vn. Let di be the degree of vi, let Ni be the set o...
AbstractLet G be a simple graph with n vertices. The matrix L(G)=D(G)−A(G) is called the Laplacian o...
AbstractLet λ1(G) denote the largest eigenvalue of the adjacency matrix and let μ1(G) denote the lar...
Let λ1 be the greatest eigenvalue and λn the least eigenvalue of the adjacency matrix of a connected...
AbstractUpper and lower estimates are found for the maximum of the kth eigenvalue of a graph as a fu...
Let λ1 be the greatest eigenvalue and λn the least eigenvalue of the adjacency matrix of a connected...
AbstractLet G be a simple graph. Let λ1(G) and μ1(G) denote the largest eigenvalue of the adjacency ...
AbstractWe first give a result on eigenvalues of the line graph of a graph. We then use the result t...
AbstractWe improve some recent results on graph eigenvalues. In particular, we prove that if G is a ...
AbstractAn upper bound for the largest eigenvalues of all but a few families of trees is given in th...
AbstractSeveral upper bounds on the largest Laplacian eigenvalue of a graph G, in terms of degree an...
AbstractThis paper is concerned with techniques for quantitative analysis of the largest p-Laplacian...
AbstractIn this paper we determine the extremal graphs for which equality in de Caen's inequality ho...
Add to ORKG