Connectivity concerning the last two subconstituents of a Q-polynomial distance-regular graph

Abstract

Let $\Gamma$ be a $Q$-polynomial distance-regular graph of diameter $d\ge 3$. Fix a vertex $\gamma$ of $\Gamma$ and consider the subgraph induced on the union of the last two subconstituents of $\Gamma$ with respect to $\gamma$. We prove that this subgraph is connected.

Journal of Combinatorial Theory, Series A, accepted for publication, 6 pages