AbstractThe study of limit points of eigenvalues of adjacency matrices of graphs was initiated by Hoffman [A.J. Hoffman, On limit points of spectral radii of non-negative symmetric integral matrices, in: Y. Alavi et al. (Eds.), Lecture Notes Math., vol. 303, Springer-Verlag, Berlin, Heidelberg, New York, 1972, pp. 165–172]. There he described all of the limit points of the largest eigenvalue of adjacency matrices of graphs that are no more than 2+5. In this paper, we investigate limit points of Laplacian spectral radii of graphs. The result is obtained: Let ω=1319+3333+19-3333+1, β0=1 and βn(n⩾1) be the largest positive root ofPn(x)=xn+1-(1+x+⋯+xn-1)x+12.Let αn=2+βn12+βn-12. Then4=α0<α1<α2<⋯are all of the limit points of Laplacian spectral ...
This paper is a survey on the upper and lower bounds for the largest eigenvalue of the Laplacian mat...
summary:The Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
Abstract. Let G =(V,E) be a simple connected graph with n vertices and e edges. Assume that the vert...
AbstractThe spectral radius of a graph is the largest eigenvalue of adjacency matrix of the graph an...
Let A(G) and D(G) be the adjacency matrix and the vertex degree matrix of a graph G, respectively. T...
AbstractLet G be a graph on n vertices. Denote by L(G) the Laplacian matrix of G. It is easy to see ...
Let A(G) and D(G) be the adjacency matrix and the degree matrix of a graph G, respectively. For any ...
AbstractFor a graph matrix M, the Hoffman limit value H(M) is the limit (if it exists) of the larges...
For a graph matrix M , the Hoffman limit value H(M) is the limit (if it exists) of the largest eige...
This paper is a survey on the upper and lower bounds for the largest eigenvalue of the Laplacian mat...
AbstractThe Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
AbstractLet G be a graph; its Laplacian matrix is the difference of the diagonal matrix of its verte...
Hoffman and Smith proved that in a graph with maximum degree Δ if all edges are subdivided infinitel...
AbstractThe Laplacian spectral radius of a graph G is the largest eigenvalue of its Laplacian matrix...
This paper is a survey on the upper and lower bounds for the largest eigenvalue of the Laplacian mat...
summary:The Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...
Abstract. Let G =(V,E) be a simple connected graph with n vertices and e edges. Assume that the vert...
AbstractThe spectral radius of a graph is the largest eigenvalue of adjacency matrix of the graph an...
Let A(G) and D(G) be the adjacency matrix and the vertex degree matrix of a graph G, respectively. T...
AbstractLet G be a graph on n vertices. Denote by L(G) the Laplacian matrix of G. It is easy to see ...
Let A(G) and D(G) be the adjacency matrix and the degree matrix of a graph G, respectively. For any ...
AbstractFor a graph matrix M, the Hoffman limit value H(M) is the limit (if it exists) of the larges...
For a graph matrix M , the Hoffman limit value H(M) is the limit (if it exists) of the largest eige...
This paper is a survey on the upper and lower bounds for the largest eigenvalue of the Laplacian mat...
AbstractThe Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
AbstractLet G be a graph; its Laplacian matrix is the difference of the diagonal matrix of its verte...
Hoffman and Smith proved that in a graph with maximum degree Δ if all edges are subdivided infinitel...
AbstractThe Laplacian spectral radius of a graph G is the largest eigenvalue of its Laplacian matrix...
This paper is a survey on the upper and lower bounds for the largest eigenvalue of the Laplacian mat...
summary:The Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
AbstractThe eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents ...