AbstractUpper and lower estimates are found for the maximum of the kth eigenvalue of a graph as a function of the number of vertices or edges
The largest eigenvalue of the adjacency matrix of a graph has received considerable attention in the...
AbstractThe sharp lower bound of the kth largest positive eigenvalue of a tree T with n vertices, an...
AbstractIn this paper we determine the extremal graphs for which equality in de Caen's inequality ho...
AbstractUpper and lower estimates are found for the maximum of the kth eigenvalue of a graph as a fu...
AbstractWe improve some recent results on graph eigenvalues. In particular, we prove that if G is a ...
We improve some recent results on graph eigenvalues. In particular, we prove that if G is a graph of...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
We improve some recent results on graph eigenvalues. In particular, we prove that if G is a graph of...
AbstractThe largest eigenvalue of the adjacency matrix of a graph has received considerable attentio...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
We present a general method for proving upper bounds on the eigenvalues of the graph Laplacian. In p...
AbstractWe first give a result on eigenvalues of the line graph of a graph. We then use the result t...
Let G = (V;E) be a simple, undirected graph with maximum and minimum degree ∆ and respectively, and ...
AbstractLet G = (V,E) be a graph on n vertices. Denote by d(v) the degree of v ∈ V and by m(v) the a...
AbstractThe largest eigenvalue of the adjacency matrix of a graph has received considerable attentio...
The largest eigenvalue of the adjacency matrix of a graph has received considerable attention in the...
AbstractThe sharp lower bound of the kth largest positive eigenvalue of a tree T with n vertices, an...
AbstractIn this paper we determine the extremal graphs for which equality in de Caen's inequality ho...
AbstractUpper and lower estimates are found for the maximum of the kth eigenvalue of a graph as a fu...
AbstractWe improve some recent results on graph eigenvalues. In particular, we prove that if G is a ...
We improve some recent results on graph eigenvalues. In particular, we prove that if G is a graph of...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
We improve some recent results on graph eigenvalues. In particular, we prove that if G is a graph of...
AbstractThe largest eigenvalue of the adjacency matrix of a graph has received considerable attentio...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
We present a general method for proving upper bounds on the eigenvalues of the graph Laplacian. In p...
AbstractWe first give a result on eigenvalues of the line graph of a graph. We then use the result t...
Let G = (V;E) be a simple, undirected graph with maximum and minimum degree ∆ and respectively, and ...
AbstractLet G = (V,E) be a graph on n vertices. Denote by d(v) the degree of v ∈ V and by m(v) the a...
AbstractThe largest eigenvalue of the adjacency matrix of a graph has received considerable attentio...
The largest eigenvalue of the adjacency matrix of a graph has received considerable attention in the...
AbstractThe sharp lower bound of the kth largest positive eigenvalue of a tree T with n vertices, an...
AbstractIn this paper we determine the extremal graphs for which equality in de Caen's inequality ho...
DOI
Add to ORKG