| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4600513 | Linear Algebra and its Applications | 2012 | 8 Pages |
Abstract
Let be the set of the complements of trees on n vertices. In this paper we characterize the unique graph whose least eigenvalue of the signless Laplacian attains the minimum among all graphs in , where is the complement of the star graph on n vertices.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
