| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4600415 | Linear Algebra and its Applications | 2012 | 14 Pages |
Abstract
The 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.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
