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
The spectrum of the Laplacian matrix of a network plays a key role in a wide range of dynamical prob...
summary:In this paper, the upper and lower bounds for the quotient of spectral radius (Laplacian spe...
AbstractThe Laplacian spectrum of a graph is the eigenvalues of the associated Laplacian matrix. The...
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...
The distance Laplacian matrix of a connected graph G is defined as ℒG=TrG−DG, where DG is the distan...
summary:The Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
AbstractThe spectral radius of a graph is the largest eigenvalue of adjacency matrix of the graph an...
In this paper we observe that the minimal signless Laplacian spectral radius is obtained uniquely at...
AbstractThe Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
AbstractThe Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
AbstractLet G be a simple graph with vertices v1,v2,…,vn, of degrees Δ=d1⩾d2⩾⋯⩾dn=δ, respectively. L...
Copyright © 2014 Jing-Ming Zhang et al. This is an open access article distributed under the Creativ...
AbstractIn the note, we present an upper bound for the spectral radius of Laplacian matrix of a grap...
AbstractLet G be a graph; its Laplacian matrix is the difference of the diagonal matrix of its verte...
The spectrum of the Laplacian matrix of a network plays a key role in a wide range of dynamical prob...
summary:In this paper, the upper and lower bounds for the quotient of spectral radius (Laplacian spe...
AbstractThe Laplacian spectrum of a graph is the eigenvalues of the associated Laplacian matrix. The...
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...
The distance Laplacian matrix of a connected graph G is defined as ℒG=TrG−DG, where DG is the distan...
summary:The Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
AbstractThe spectral radius of a graph is the largest eigenvalue of adjacency matrix of the graph an...
In this paper we observe that the minimal signless Laplacian spectral radius is obtained uniquely at...
AbstractThe Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
AbstractThe Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
AbstractLet G be a simple graph with vertices v1,v2,…,vn, of degrees Δ=d1⩾d2⩾⋯⩾dn=δ, respectively. L...
Copyright © 2014 Jing-Ming Zhang et al. This is an open access article distributed under the Creativ...
AbstractIn the note, we present an upper bound for the spectral radius of Laplacian matrix of a grap...
AbstractLet G be a graph; its Laplacian matrix is the difference of the diagonal matrix of its verte...
The spectrum of the Laplacian matrix of a network plays a key role in a wide range of dynamical prob...
summary:In this paper, the upper and lower bounds for the quotient of spectral radius (Laplacian spe...
AbstractThe Laplacian spectrum of a graph is the eigenvalues of the associated Laplacian matrix. The...
DOI
Add to ORKG