English

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

Combinatorics 2020-08-28 v2

Abstract

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

Keywords

Cite

@article{arxiv.1912.06245,
  title  = {Connectivity concerning the last two subconstituents of a Q-polynomial distance-regular graph},
  author = {Sebastian M. Cioabă and Jack H. Koolen and Paul Terwilliger},
  journal= {arXiv preprint arXiv:1912.06245},
  year   = {2020}
}

Comments

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