Distance-Regular Graphs with Strongly Regular Subconstituents |
| |
| Authors: | Anna Kasikova |
| |
| Affiliation: | (1) Department of Mathematics, Kansas State University, Manhattan, KS, 66506 |
| |
| Abstract: | 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. |
| |
| Keywords: | distance-regular graph strongly regular graph association scheme |
| 本文献已被 SpringerLink 等数据库收录！ |
|
