Abstract
This paper summarizes the known results on graphs with smallest eigenvalue around -2, and completes the theory by proving a number of new results, giving comprehensive tables of the finitely many exceptions, and posing some new problems. Then the theory is applied to characterize a class of distance-regular graphs of large diameter by their intersection array.
Original language | English |
---|---|
Pages (from-to) | 583-608 |
Number of pages | 26 |
Journal | Mathematics of Computation |
Volume | 59 |
Issue number | 200 |
DOIs | |
Publication status | Published - 1992 |