Distance-regular Subgraphs in a Distance-regular Graph, V
Distance-regular Subgraphs in a Distance-regular Graph, V
复制标题
距离正则图中的距离正则子图，V
DOI：
10.1006/eujc.1997.0167
复制
发表时间：
1998
期刊：
影响因子：
--
通讯作者：
Akira Hiraki
中科院分区：
文献类型：
--
作者：
Akira Hiraki
令 Γ 为没有诱导子图的距离正则图 K2,1,1andr=max {j∣ (cj,aj,bj)= (c1,a1,b1)}。我们给出强闭子图存在的充分必要条件，该子图是直径为r+1的(cr+1+ar+1)-正则子图，包含距离r+1处的给定顶点对。
Let Γ be a distance-regular graph without induced subgraphsK2,1,1andr=max {j∣ (cj,aj,bj)= (c1,a1,b1)}. We give a necessary and sufficient condition for the existence of a strongly closed subgraph which is (cr+1+ar+1)-regular of diameterr+1 containing a given pair of vertices at distancer+1.