| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4601054 | Linear Algebra and its Applications | 2011 | 11 Pages |
Abstract
In this paper, we identify within connected graphs of order n and size n+k (with and ) the graphs whose least eigenvalue is minimal. It is also observed that the same graphs have the largest spectral spread if n is large enough.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
