| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4600260 | Linear Algebra and its Applications | 2012 | 9 Pages |
Abstract
We determine all trees whose second largest eigenvalue does not exceed . Next, we consider two classes of bipartite graphs, regular and semiregular, with small number of distinct eigenvalues. For all graphs considered we determine those whose second largest eigenvalue is equal to . Some additional results are also given.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
