AbstractThe Laplacian spectral radius of a graph G is the largest eigenvalue of its Laplacian matrix. In this paper, the first three smallest values of the Laplacian spectral radii among all connected graphs with clique number ω are obtained
AbstractTricyclic graphs are connected graphs in which the number of edges equals the number of vert...
AbstractA unicyclic graph is a graph whose number of edges is equal to the number of vertices. Guo S...
AbstractFor a graph G, its Laplacian matrix is the difference of the diagonal matrix of its vertex d...
AbstractThe Laplacian spectral radius of a graph G is the largest eigenvalue of its Laplacian matrix...
AbstractThe Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
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...
summary:The Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
summary:In this paper, the upper and lower bounds for the quotient of spectral radius (Laplacian spe...
AbstractThe spectral radius of a graph is the largest eigenvalue of adjacency matrix of the graph an...
summary:In this paper, the upper and lower bounds for the quotient of spectral radius (Laplacian spe...
In this paper we observe that the minimal signless Laplacian spectral radius is obtained uniquely at...
AbstractLet B(n,d) be the set of bipartite graphs with order n and diameter d. The extremal graph Gd...
The distance Laplacian matrix of a connected graph G is defined as ℒG=TrG−DG, where DG is the distan...
AbstractIn this paper, we give a complete characterization of the extremal graphs with maximal Lapla...
AbstractTricyclic graphs are connected graphs in which the number of edges equals the number of vert...
AbstractA unicyclic graph is a graph whose number of edges is equal to the number of vertices. Guo S...
AbstractFor a graph G, its Laplacian matrix is the difference of the diagonal matrix of its vertex d...
AbstractThe Laplacian spectral radius of a graph G is the largest eigenvalue of its Laplacian matrix...
AbstractThe Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
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...
summary:The Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
summary:In this paper, the upper and lower bounds for the quotient of spectral radius (Laplacian spe...
AbstractThe spectral radius of a graph is the largest eigenvalue of adjacency matrix of the graph an...
summary:In this paper, the upper and lower bounds for the quotient of spectral radius (Laplacian spe...
In this paper we observe that the minimal signless Laplacian spectral radius is obtained uniquely at...
AbstractLet B(n,d) be the set of bipartite graphs with order n and diameter d. The extremal graph Gd...
The distance Laplacian matrix of a connected graph G is defined as ℒG=TrG−DG, where DG is the distan...
AbstractIn this paper, we give a complete characterization of the extremal graphs with maximal Lapla...
AbstractTricyclic graphs are connected graphs in which the number of edges equals the number of vert...
AbstractA unicyclic graph is a graph whose number of edges is equal to the number of vertices. Guo S...
AbstractFor a graph G, its Laplacian matrix is the difference of the diagonal matrix of its vertex d...
DOI
Add to ORKG