Add to ORKGThe Laplacian spread of a graph is defined to be the difference between the largest eigenvalue and the second smallest eigenvalue of the Laplacian matrix of the graph. In this paper, we show that the star is the unique tree with maximal Laplacian spread among all trees of given order, and the path is the unique one with minimal Laplacian spread among all trees of given order
The spread of an $n\times n$ complex matrix $B$ with eigenvalues $\beta _{1},\beta _{2},\ldots ,\be...
AbstractThe spread of a graph is defined to be the difference between the largest eigenvalue and the...
Let G be an undirected simple graph. The signless Laplacian spread of G is defined as the maximum di...
Graphs and AlgorithmsThe Laplacian spread of a graph is defined to be the difference between the lar...
AbstractThe Laplacian spread of a graph is defined to be the difference between the largest eigenval...
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 Laplacian spread of a graph is defined to be the difference between the largest eigenval...
AbstractThe Laplacian spread of a graph is defined to be the difference between the largest eigenval...
The Laplacian spread of a graph $G$ is defined as the difference between the largest and the second...
AbstractThe signless Laplacian spread of G is defined as SQ(G)=μ1(G)-μn(G), where μ1(G) and μn(G) ar...
summary:The Laplacian spread of a graph is defined as the difference between the largest and second ...
summary:The Laplacian spread of a graph is defined as the difference between the largest and second ...
Abstract. It is shown that among all trees with a fixed number of vertices the path has the smallest...
The spread of an $n\times n$ complex matrix $B$ with eigenvalues $\beta _{1},\beta _{2},\ldots ,\be...
AbstractThe spread of a graph is defined to be the difference between the largest eigenvalue and the...
Let G be an undirected simple graph. The signless Laplacian spread of G is defined as the maximum di...
Graphs and AlgorithmsThe Laplacian spread of a graph is defined to be the difference between the lar...
AbstractThe Laplacian spread of a graph is defined to be the difference between the largest eigenval...
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 Laplacian spread of a graph is defined to be the difference between the largest eigenval...
AbstractThe Laplacian spread of a graph is defined to be the difference between the largest eigenval...
The Laplacian spread of a graph $G$ is defined as the difference between the largest and the second...
AbstractThe signless Laplacian spread of G is defined as SQ(G)=μ1(G)-μn(G), where μ1(G) and μn(G) ar...
summary:The Laplacian spread of a graph is defined as the difference between the largest and second ...
summary:The Laplacian spread of a graph is defined as the difference between the largest and second ...
Abstract. It is shown that among all trees with a fixed number of vertices the path has the smallest...
The spread of an $n\times n$ complex matrix $B$ with eigenvalues $\beta _{1},\beta _{2},\ldots ,\be...
AbstractThe spread of a graph is defined to be the difference between the largest eigenvalue and the...
Let G be an undirected simple graph. The signless Laplacian spread of G is defined as the maximum di...