| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4602051 | Linear Algebra and its Applications | 2010 | 6 Pages |
Abstract
The Laplacian spread of a graph [1] is defined as the difference between the largest eigenvalue and the second-smallest eigenvalue of the associated Laplacian matrix. In this paper, the minimum Laplacian spread of unicyclic graphs with given order is determined.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
