Let μ (G) and μmin (G) be the largest and smallest eigenvalues of the adjacency-matrix of a graph G. Our main results are: (i) Let G be a regular graph of order n and finite diameter D. If H is a proper subgraph of G, then μ(G)-μ(H) \u3e 1/nD. (ii) If G is a regular nonbipartite graph of order n and finite diameter D, then μ (G) +μmin (G) 1/nD
AbstractWe prove a number of relations between the number of cliques of a graph G and the largest ei...
AbstractIn this paper we determine the graphs which have the minimal spectral radius (i.e., the larg...
We prove a number of relations between the number of cliques of a graph G and the largest eigenvalue...
Let μ (G) and μmin (G) be the largest and smallest eigenvalues of the adjacency matrix of a graph G....
AbstractLet G be a simple connected graph with n vertices and m edges. Let δ(G)=δ be the minimum deg...
An undirected graph is called k-regular if exactly k edges meet at each vertex. The eigenvalues of t...
Let A(G) and D(G) be the adjacency matrix and the degree matrix of a graph G, respectively. For any ...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
We prove three results about the spectral radius μ(G) of a graph G:(a)Let Tr (n) be the r-partite Tu...
AbstractWe prove three results about the spectral radius μ(G) of a graph G:(a)Let Tr(n) be the r-par...
Abstract. Let G =(V,E) be a simple connected graph with n vertices and e edges. Assume that the vert...
Spectral Radius of Graphs provides a thorough overview of important results on the spectral radius o...
Let G be a graph with n vertices and μ (G) be the largest eigenvalue of the adjacency matrix of G. W...
AbstractLet G be a simple connected graph with n vertices, m edges and degree sequence: d1⩾d2⩾⋯⩾dn. ...
AbstractLet G be a graph with n vertices and μ(G) be the largest eigenvalue of the adjacency matrix ...
AbstractWe prove a number of relations between the number of cliques of a graph G and the largest ei...
AbstractIn this paper we determine the graphs which have the minimal spectral radius (i.e., the larg...
We prove a number of relations between the number of cliques of a graph G and the largest eigenvalue...
Let μ (G) and μmin (G) be the largest and smallest eigenvalues of the adjacency matrix of a graph G....
AbstractLet G be a simple connected graph with n vertices and m edges. Let δ(G)=δ be the minimum deg...
An undirected graph is called k-regular if exactly k edges meet at each vertex. The eigenvalues of t...
Let A(G) and D(G) be the adjacency matrix and the degree matrix of a graph G, respectively. For any ...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
We prove three results about the spectral radius μ(G) of a graph G:(a)Let Tr (n) be the r-partite Tu...
AbstractWe prove three results about the spectral radius μ(G) of a graph G:(a)Let Tr(n) be the r-par...
Abstract. Let G =(V,E) be a simple connected graph with n vertices and e edges. Assume that the vert...
Spectral Radius of Graphs provides a thorough overview of important results on the spectral radius o...
Let G be a graph with n vertices and μ (G) be the largest eigenvalue of the adjacency matrix of G. W...
AbstractLet G be a simple connected graph with n vertices, m edges and degree sequence: d1⩾d2⩾⋯⩾dn. ...
AbstractLet G be a graph with n vertices and μ(G) be the largest eigenvalue of the adjacency matrix ...
AbstractWe prove a number of relations between the number of cliques of a graph G and the largest ei...
AbstractIn this paper we determine the graphs which have the minimal spectral radius (i.e., the larg...
We prove a number of relations between the number of cliques of a graph G and the largest eigenvalue...
DOI
Add to ORKG