3-bounded property in a triangle-free distance-regular graph

Abstract

Let Γ denote a distance-regular graph with classical parameters (D, b, α, β) and D ≥ 3. Assume the intersection numbers a 1 = 0 and a 2 = 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].

Distance-regular graphs

“…Triangle-free distance regular graphs with classical parameters have been studied by Pan, Lu, and Weng [527,528,529] and Hiraki [317]. One of the results is that if Γ has classical parameters and [529,317].…”