A bound for the number of columns ℓ(c,a,b) in the intersection array of a distance-regular graph

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.