AbstractA graph is said to have a small spectral radius if it does not exceed the corresponding Hoffmann limit value. In the case of (signless) Laplacian matrix, the Hoffmann limit value is equal to ϵ+2=4.38+, with ϵ being the real root of x3-4x-4. Here the spectral characterization of connected graphs with small (signless) Laplacian spectral radius is considered. It is shown that all connected graphs with small Laplacian spectral radius are determined by their Laplacian spectra, and all but one of connected graphs with small signless Laplacian spectral radius are determined by their signless Laplacian spectra
The distance signless Laplacian spectral radius of a connected graph G is the largest eigenvalue of ...
The \emph{distance matrix} of a simple connected graph $G$ is $D(G)=(d_{ij})$, where $d_{ij}$ is the...
We determine a lower bound for the spectral radius of a graph in terms of the number of vertices and...
A graph is said to have a small spectral radius if it does not exceed the corresponding Hoffmann lim...
A graph is said to have a small spectral radius if it does not exceed the corresponding Hoffmann lim...
A graph is said to have a small spectral radius if it does not exceed the corresponding Hoffmann lim...
AbstractA graph is said to have a small spectral radius if it does not exceed the corresponding Hoff...
In this paper, we determine the maximum signless Laplacian spectral radius of all graphs which do no...
In this paper we observe that the minimal signless Laplacian spectral radius is obtained uniquely at...
AbstractThe Laplacian spectral radius of a graph G is the largest eigenvalue of its Laplacian matrix...
AbstractThe spectral radius of a graph is the largest eigenvalue of adjacency matrix of the graph an...
AbstractLet G be a simple graph with vertices v1,v2,…,vn, of degrees Δ=d1⩾d2⩾⋯⩾dn=δ, respectively. L...
AbstractIn this paper, we characterize the graphs with maximum signless Laplacian or adjacency spect...
summary:The Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
Let A(G) and D(G) be the adjacency matrix and the degree matrix of a graph G, respectively. For any ...
The distance signless Laplacian spectral radius of a connected graph G is the largest eigenvalue of ...
The \emph{distance matrix} of a simple connected graph $G$ is $D(G)=(d_{ij})$, where $d_{ij}$ is the...
We determine a lower bound for the spectral radius of a graph in terms of the number of vertices and...
A graph is said to have a small spectral radius if it does not exceed the corresponding Hoffmann lim...
A graph is said to have a small spectral radius if it does not exceed the corresponding Hoffmann lim...
A graph is said to have a small spectral radius if it does not exceed the corresponding Hoffmann lim...
AbstractA graph is said to have a small spectral radius if it does not exceed the corresponding Hoff...
In this paper, we determine the maximum signless Laplacian spectral radius of all graphs which do no...
In this paper we observe that the minimal signless Laplacian spectral radius is obtained uniquely at...
AbstractThe Laplacian spectral radius of a graph G is the largest eigenvalue of its Laplacian matrix...
AbstractThe spectral radius of a graph is the largest eigenvalue of adjacency matrix of the graph an...
AbstractLet G be a simple graph with vertices v1,v2,…,vn, of degrees Δ=d1⩾d2⩾⋯⩾dn=δ, respectively. L...
AbstractIn this paper, we characterize the graphs with maximum signless Laplacian or adjacency spect...
summary:The Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
Let A(G) and D(G) be the adjacency matrix and the degree matrix of a graph G, respectively. For any ...
The distance signless Laplacian spectral radius of a connected graph G is the largest eigenvalue of ...
The \emph{distance matrix} of a simple connected graph $G$ is $D(G)=(d_{ij})$, where $d_{ij}$ is the...
We determine a lower bound for the spectral radius of a graph in terms of the number of vertices and...