Exceptional graphs with smallest eigenvalue -2 and related problems
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.
- Publication:
-
Mathematics of Computation
- Pub Date:
- October 1992
- DOI:
- 10.1090/S0025-5718-1992-1134718-6
- Bibcode:
- 1992MaCom..59..583B