Distance-Regular Graphs with Strongly Regular Subconstituents

被引：0
作者：
Anna Kasikova
机构：
[1] Kansas State University,Department of Mathematics
来源：
Journal of Algebraic Combinatorics | 1997年 / 6卷
关键词：
distance-regular graph; strongly regular graph; association scheme;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In [3] Cameron et al. classified strongly regular graphs with strongly regular subconstituents. Here we prove a theorem which implies that distance-regular graphs with strongly regular subconstituents are precisely the Taylor graphs and graphs with a1 = 0 and ai ∈ {0,1} for i = 2,...,d.
引用
收藏
页码：247 / 252
页数：5
相关论文
共 5 条
  • [1] Cameron P.J.(1978)Strongly regular graphs having strongly regular subconstituents J. Algebra 55 257-280
  • [2] Goethals J.M.(1972)The graph extension theorem Proc. Am. Math. Soc. 33 278-284
  • [3] Seidel J.J.(1977)Regular 2–graphs Proc. London Math. Soc. 35 257-274
  • [4] Shult E.E.(undefined)undefined undefined undefined undefined-undefined
  • [5] Taylor D.E.(undefined)undefined undefined undefined undefined-undefined
1