Abstract
In this chapter we collect most of the restrictions on intersection arrays of distance-regular graphs known to us. (A few very basic facts have already been mentioned in §4.1D.) Some of these restrictions are important tools in the theoretical investigation of the properties of distance-regular graphs, like the unimodality of the sequence (k i ) i discussed in §5.1. (We already used this on several occasions.) Various bounds on the diameter in terms of the valency are theoretically important. First we have Terwilliger’s diameter bound for the case where the graph contains a quadrangle; next Ivanov’s theory, which yields abound on the diameter for arbitrary distance-regular graphs with fixed numerical girth, and finally the work by Bannai & Ito, who strive to remove the dependency on the girth from these bounds. Also Godsil proved diameter bounds, but this time in terms of a multiplicity.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Brouwer, A.E., Cohen, A.M., Neumaier, A. (1989). Parameter Restrictions for Distance-Regular Graphs. In: Distance-Regular Graphs. Ergebnisse der Mathematik und ihrer Grenzgebiete, vol 18. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-74341-2_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-74341-2_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-74343-6
Online ISBN: 978-3-642-74341-2
eBook Packages: Springer Book Archive