Abstract
We show that the number of columns (1,k − 2, 1) in the intersection array of distance-regular graphs is at most 20.
Similar content being viewed by others
References
Bannai, E., Ito, T.: Algebraic Combinatorics I; Benjamin-Cummings, California (1984)
Bannai, E., Ito, T.: On distance-regular graph with fixed valency. Graphs and Combin.3, 95–109 (1987)
Biggs, N.L., Boshier, A.G., Shawe-Taylor, J.: Cubic distance-regular graphs. J. Comb. Theory Ser. B44, 147–153 (1986)
Boshier, A., Nomura, K.: A remark on the intersection arrays of distance-regular graphs. J. Comb. Theory Ser. B44, 147–153 (1988)
Brouwer, A.E., Cohen, A.M., Neumaier, A.: Distance-Regular Graphs, Springer Verlag, Berlin, Heidelberg (1989)
Higashitani, N., Suzuki, H.: Bounding the number of columns (1,k − 2, 1) in the intersection array of a distance-regular graph. Math. Japonica37, 487–494 (1992)
Hiraki, A.: An improvement of the Boshier-Nomura bound. (1993) J. Comb. Theory Ser. B61, 1–4 (1993)
Suzuki, H.: On distance-regular graphs withb e = 1. SUT. J. of Math.29, 1–14 (1993)
Terwilliger, P.: Eigenvalue multiplicities of highly symmetric graphs. Discrete Math.41, 295–302 (1989)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hiraki, A. A constant bound on the number of columns (1,k − 2, 1) in the intersection array of a distance-regular graph. Graphs and Combinatorics 12, 23–37 (1996). https://doi.org/10.1007/BF01858442
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF01858442