Abstract
Let Γ be a distance regular graph with intersection array b 0, b 1,..., b d−1; c 1,..., c d. It is shown that in some cases (c i−1, a i−1, b i−1) = (c 1, a 1, b 1)and (c 2i−1, a 2i−1, b 2i−1) imply k ≤ 2b i + 1. As a corollary all distance regular graphs of diameter d = 3i − 1 with b i = 1 and k > 2 are determined.
Similar content being viewed by others
References
Biggs, N.L., Boshier, A.G., and Shawe-Taylor, J. 1986. “Cubic distance-regular graphs,” J. London Math. Soc. (2), 33:385–394.
Boshier, A.G., and Nomura, K. 1988. “A remark on the intersection arrays of distance-regular graphs,” J. Combinatorial Theory (B), 44:147–153.
Brouwer, A.E., Cohen, A.M., and Neumaier, A. 1989. Distance Regular Graphs, Ergebnisse der Mathematik und ihrer Grenzgebiete 3.Folge Band 18, Berlin Heidelberg: Springer-Verlag.
Godsil, C.D. 1988. “Bounding the diameter of distance regular graphs,” Combinatorica, 8:333–343.
Suzuki, H. “On a distance regular graph with b e = 1,” preprint.
Author information
Authors and Affiliations
Additional information
Communicated by A.E. Brouwer
Rights and permissions
About this article
Cite this article
Lambeck, E.W. A remark on the intersection arrays of distance regular graphs and the distance regular graphs of diameter d = 3i − 1 with b i = 1 and k > 2. Des Codes Crypt 1, 261–266 (1991). https://doi.org/10.1007/BF00123766
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00123766