2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/137364Let $Γ$ denote a distance-regular graph with classical parameters $(D, b, α, β)$ and $D\geq 3$. Assume the intersection numbers $a_1=0$ and $a_2\not=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].13 pagesCombinatoricstext