当前位置:
X-MOL 学术
›
J. Comb. Theory A
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
Connectivity concerning the last two subconstituents of a Q-polynomial distance-regular graph
Journal of Combinatorial Theory Series A ( IF 0.9 ) Pub Date : 2020-09-02 , DOI: 10.1016/j.jcta.2020.105325 S.M. Cioabă , J.H. Koolen , P. Terwilliger
中文翻译:
关于Q多项式距离正则图的最后两个子成分的连通性
更新日期:2020-09-02
Journal of Combinatorial Theory Series A ( IF 0.9 ) Pub Date : 2020-09-02 , DOI: 10.1016/j.jcta.2020.105325 S.M. Cioabă , J.H. Koolen , P. Terwilliger
Let Γ be a Q-polynomial distance-regular graph of diameter . 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.
中文翻译:
关于Q多项式距离正则图的最后两个子成分的连通性
令Γ为直径的Q多项式距离正则图。修正了一个顶点γ Γ并考虑对诱导Γ的最后两个次成分的结合相对于子图γ。我们证明该子图是连通的。