Add to ORKGLet G be a simple connected graph with n vertices and n edges which we call an unicyclic graph. In this paper, we first investigate the least eigenvalue λn(G), then we present two sharp bounds of the spread s(G) of G. AMS classification: 05C50,05C3
Let G be an undirected simple graph. The signless Laplacian spread of G is defined as the maximum di...
summary:Let $G$ be a connected graph of order $n$ and $U$ a unicyclic graph with the same order. We ...
summary:Let $G$ be a connected graph of order $n$ and $U$ a unicyclic graph with the same order. We ...
AbstractLet G be a simple connected graph with n vertices and n edges which we call a unicyclic grap...
AbstractThe spread of a graph is defined to be the difference between the largest eigenvalue and the...
AbstractThe spread of a graph is defined to be the difference between the largest eigenvalue and the...
AbstractThe Laplacian spread of a graph is defined to be the difference between the largest eigenval...
AbstractThe Laplacian spread s(G) of a graph G is defined to be the difference between the largest e...
summary:The Laplacian spread of a graph is defined as the difference between the largest and second ...
AbstractThe spread of a graph is defined to be the difference between the greatest eigenvalue and th...
AbstractUpper and lower bounds are obtained for the spread λ1−λn of the eigenvalues λ1⩾λ2⩾⋯⩾λn of th...
AbstractThe signless Laplacian spread of G is defined as SQ(G)=μ1(G)-μn(G), where μ1(G) and μn(G) ar...
AbstractLet G be a simple connected graph with n vertices and n edges which we call a unicyclic grap...
In this paper we explore some results concerning the spread of the line and the total graph of a giv...
AbstractThe Laplacian spread of a graph is defined to be the difference between the largest eigenval...
Let G be an undirected simple graph. The signless Laplacian spread of G is defined as the maximum di...
summary:Let $G$ be a connected graph of order $n$ and $U$ a unicyclic graph with the same order. We ...
summary:Let $G$ be a connected graph of order $n$ and $U$ a unicyclic graph with the same order. We ...
AbstractLet G be a simple connected graph with n vertices and n edges which we call a unicyclic grap...
AbstractThe spread of a graph is defined to be the difference between the largest eigenvalue and the...
AbstractThe spread of a graph is defined to be the difference between the largest eigenvalue and the...
AbstractThe Laplacian spread of a graph is defined to be the difference between the largest eigenval...
AbstractThe Laplacian spread s(G) of a graph G is defined to be the difference between the largest e...
summary:The Laplacian spread of a graph is defined as the difference between the largest and second ...
AbstractThe spread of a graph is defined to be the difference between the greatest eigenvalue and th...
AbstractUpper and lower bounds are obtained for the spread λ1−λn of the eigenvalues λ1⩾λ2⩾⋯⩾λn of th...
AbstractThe signless Laplacian spread of G is defined as SQ(G)=μ1(G)-μn(G), where μ1(G) and μn(G) ar...
AbstractLet G be a simple connected graph with n vertices and n edges which we call a unicyclic grap...
In this paper we explore some results concerning the spread of the line and the total graph of a giv...
AbstractThe Laplacian spread of a graph is defined to be the difference between the largest eigenval...
Let G be an undirected simple graph. The signless Laplacian spread of G is defined as the maximum di...
summary:Let $G$ be a connected graph of order $n$ and $U$ a unicyclic graph with the same order. We ...
summary:Let $G$ be a connected graph of order $n$ and $U$ a unicyclic graph with the same order. We ...