An Improvement of the Boshier-Nomura Bound

We show that the number of columns (ci, ai, bi) = (1, 1, k − 2) in the intersection arrays of distance-regular graphs is at most three if the column (1, 0, k − 1) exists. This improves the Bosheir-Nomura bound from four to three.