Let Ξ denote a distance-regular graph with classical parameters (D,b,Ξ±,Ξ²) and Dβ₯3. Assume the intersection numbers a1β=0 and
a2βξ =0. We show Ξ is 3-bounded in the sense of the article
[D-bounded distance-regular graphs, European Journal of Combinatorics(1997)18,
211-229].Comment: 13 page