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

Abstract

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

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…