Distance-Regular Graphs with Strongly RegularSubconstituents

详细信息

下载全文

推荐本文 |

• 作者：Kasikova ; Anna
• 关键词：distance ; regular graph ; strongly regular graph ; association scheme
• 刊名：Journal of Algebraic Combinatorics
• 出版时间：1997
• 出版年：1997
• 期刊代码：75_09259899
• 类别：bio
• 卷：6
• 期：3
• 页码：247-252
• 数据来源：sp

摘要

In [3] Cameron et al. classified strongly regular graphs withstrongly regular subconstituents. Here we prove a theorem whichimplies that distance-regular graphs with strongly regularsubconstituents are precisely the Taylor graphs and graphs with$a\_1=0$ and $a\_i\backslash in\; \backslash \; 0,1\backslash$ for$i=2,\backslash ldots,d$.