Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4657075 | Journal of Combinatorial Theory, Series B | 2010 | 12 Pages |
Abstract
A non-complete geometric distance-regular graph is the point graph of a partial linear space in which the set of lines is a set of Delsarte cliques. In this paper, we prove that for a fixed integer m⩾2, there are only finitely many non-geometric distance-regular graphs with smallest eigenvalue at least −m, diameter at least three and intersection number c2⩾2.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics