4 research outputs found
Non-geometric distance-regular graphs of diameter at least with smallest eigenvalue at least
In this paper, we classify non-geometric distance-regular graphs of diameter
at least with smallest eigenvalue at least . This is progress towards
what is hoped to be an eventual complete classification of distance-regular
graphs with smallest eigenvalue at least , analogous to existing
classification results available in the case that the smallest eigenvalue is at
least
Distance-regular graphs
This is a survey of distance-regular graphs. We present an introduction to
distance-regular graphs for the reader who is unfamiliar with the subject, and
then give an overview of some developments in the area of distance-regular
graphs since the monograph 'BCN' [Brouwer, A.E., Cohen, A.M., Neumaier, A.,
Distance-Regular Graphs, Springer-Verlag, Berlin, 1989] was written.Comment: 156 page