On the connectedness of the complement of a ball in distance-regular graphs
An important property of strongly regular graphs is that the second subconstituent of any primitive strongly regular graph is always connected. Brouwer asked to what extent this statement can be generalized to distance-regular graphs. In this paper, we show that if ? is any vertex of a distance-regular graph ? and t is the index where the standard sequence corresponding to the second largest eigenvalue of ? changes sign, then the subgraph induced by the vertices at distance at least t from?, is connected.
connectivity distance-regular graph strongly regular graph subconstituent standard sequence eigenvalue