AbstractWe give upper bounds for the spectral radius of a graph with e edges provided that there is no complete graph with e edges. Our bounds are sharp for (i) the complete graphs with one, two, or three edges removed; (ii) the complete graph with one added vertex and edge
AbstractWe determine a lower bound for the spectral radius of a graph in terms of the number of vert...
AbstractThe spectral radius ρ(G) of a graph G is the largest eigenvalue of its adjacency matrix. Let...
summary:The Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
AbstractWe give upper bounds for the spectral radius of a graph with e edges provided that there is ...
AbstractThe spectral radius ϱ(A) of the adjacency matrix A of a graph G with e edges satisfies ϱ(A)⩽...
We prove three results about the spectral radius (G) of a graph G: (a) Let Tr (n) be the r-partite ...
AbstractWe present a new type of lower bound for the spectral radius of a graph in which m nodes are...
AbstractLet G be a simple connected graph with n vertices, m edges and degree sequence: d1⩾d2⩾⋯⩾dn. ...
AbstractWe prove three results about the spectral radius μ(G) of a graph G:(a)Let Tr(n) be the r-par...
Let G be a simple connected graph with n vertices, m edges and degree sequence: d1 ≥ d2 · · · ≥ d...
AbstractWe study the spectral radius of graphs with n vertices and k cut edges. In this paper, we sh...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
We determine a lower bound for the spectral radius of a graph in terms of the number of vertices and...
AbstractLet G be a simple connected graph with n vertices and m edges. Let δ(G)=δ be the minimum deg...
We study the spectral radius of graphs with n vertices and k cut edges. In this paper, we show that ...
AbstractWe determine a lower bound for the spectral radius of a graph in terms of the number of vert...
AbstractThe spectral radius ρ(G) of a graph G is the largest eigenvalue of its adjacency matrix. Let...
summary:The Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
AbstractWe give upper bounds for the spectral radius of a graph with e edges provided that there is ...
AbstractThe spectral radius ϱ(A) of the adjacency matrix A of a graph G with e edges satisfies ϱ(A)⩽...
We prove three results about the spectral radius (G) of a graph G: (a) Let Tr (n) be the r-partite ...
AbstractWe present a new type of lower bound for the spectral radius of a graph in which m nodes are...
AbstractLet G be a simple connected graph with n vertices, m edges and degree sequence: d1⩾d2⩾⋯⩾dn. ...
AbstractWe prove three results about the spectral radius μ(G) of a graph G:(a)Let Tr(n) be the r-par...
Let G be a simple connected graph with n vertices, m edges and degree sequence: d1 ≥ d2 · · · ≥ d...
AbstractWe study the spectral radius of graphs with n vertices and k cut edges. In this paper, we sh...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
We determine a lower bound for the spectral radius of a graph in terms of the number of vertices and...
AbstractLet G be a simple connected graph with n vertices and m edges. Let δ(G)=δ be the minimum deg...
We study the spectral radius of graphs with n vertices and k cut edges. In this paper, we show that ...
AbstractWe determine a lower bound for the spectral radius of a graph in terms of the number of vert...
AbstractThe spectral radius ρ(G) of a graph G is the largest eigenvalue of its adjacency matrix. Let...
summary:The Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
DOI
Add to ORKG