3-bounded property in a triangle-free distance-regular graph (Q942133)

A sequence \(x,y,z\) of vertices in a graph \(\Gamma\) is called weak-geodetic if \(\partial(x,y)+\partial(y,z)\leq\partial(x,z)+1\), where \(\partial\) is the distance function on \(\Gamma\). A subset \(\Omega\) of the vertex set of \(\Gamma\) is called weak-geodetically closed if for any weak-geodetic sequence \(x,y,z\) in \(\Gamma\), \(x,z\in\Omega\) implies \(y\in\Omega\). A graph \(\Gamma\) is said to be \(i\)-bounded \((i\in{\mathbf{N}})\) if for all \(x,y\in X\) with \(\partial(x,y)\leq i\), there is a regular weak-geodetically closed subgraph of \(\Gamma\) of diameter \(\partial(x,y)\) which contains \(x\) and \(y\). From authors' abstract: ``Let \(\Gamma\) denote a distance-regular graph with classical parameters \((D,b,\alpha,\beta)\) and \(D\geq 3\). Assume the intersection numbers \(a_1=0\) and \(a_2\neq 0\). We show that \(\Gamma\) is \(3\)-bounded.''