Title of article
A bound for the number of columns ℓ(c,a,b) in the intersection array of a distance-regular graph
Author/Authors
Bang، نويسنده , , S. and Koolen، نويسنده , , J.H. and Moulton، نويسنده , , V.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
11
From page
785
To page
795
Abstract
In this paper we give a bound for the number ℓ(c,a,b) of columns (c,a,b)T in the intersection array of a distance-regular graph. We also show that this bound is intimately related to the Bannai–Ito conjecture.
Journal title
European Journal of Combinatorics
Serial Year
2003
Journal title
European Journal of Combinatorics
Record number
1549993
Link To Document