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

preprint2020arXivOpen access

Abstract

Let ΓΓ be a QQ-polynomial distance-regular graph of diameter d≥3d\geq 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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.