Distance-regular graphs and (s, c, a, k)-graphs
Distance-regular graphs and (s, c, a, k)-graphs
复制标题
距离正则图和 (s, c, a, k) 图
DOI：
10.1016/0095-8956(83)90015-1
复制
发表时间：
1983
期刊：
影响因子：
--
通讯作者：
Paul M. Terwilliger
中科院分区：
文献类型：
--
作者：
Paul M. Terwilliger
给出了一类包含偶数围长的距离正则图的直径有界定理。引入了一类新的图，称为(S，c，a，k)-图，它们被猜想为包含有限距离正则图的足够的局部结构，使得它们都是有限的。证明了它们是有限的，并在≤c中给出了直径的界。
A diameter-bound theorem for a class of distance-regular graphs which includes all those with even girth is presented. A new class of graphs, called (s, c, a, k)-graphs, is introduced, which are conjectured to contain enough of the local structure of finite distance-regular graphs for them all to be finite. It is proved that they are finite and a bound on the diameter is given in the casea≤c.