A constant bound on the number of columns (1, k - 2, 1) in the intersection array of a distance-regular graph

Graphs and Combinatorics

Volumn 12, Issue 1, 1996, Pages 23-37

  Hiraki, Akira ^a  

^a OSAKA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0141771214     PISSN: 09110119     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01858442     Document Type: Article

References (9)

1. Bannai, E., Ito, T.: Algebraic Combinatorics I; Benjamin-Cummings, California (1984)
2. Bannai, E., Ito, T.: On distance-regular graph with fixed valency. Graphs and Combin. 3, 95-109 (1987)
3. Biggs, N.L., Boshier, A.G., Shawe-Taylor, J.: Cubic distance-regular graphs. J. Comb. Theory Ser. B 44, 147-153 (1986)
4. Boshier, A., Nomura, K.: A remark on the intersection arrays of distance-regular graphs. J. Comb. Theory Ser. B 44, 147-153 (1988)
5. Brouwer, A.E., Cohen, A.M., Neumaier, A.: Distance-Regular Graphs, Springer Verlag, Berlin, Heidelberg (1989)
6. Higashitani, N., Suzuki, H.: Bounding the number of columns (1, k - 2, 1) in the intersection array of a distance-regular graph. Math. Japonica 37, 487-494 (1992)
7. Hiraki, A.: An improvement of the Boshier-Nomura bound. (1993) J. Comb. Theory Ser. B 61, 1-4 (1993)
8. e = 1. SUT. J. of Math. 29, 1-14 (1993)
9. Terwilliger, P.: Eigenvalue multiplicities of highly symmetric graphs. Discrete Math. 41, 295-302 (1989)