A strongly regular decomposition of the complete graph and its association scheme
暂无分享,去创建一个
Abstract For any positive integer m, the complete graph on 2 2 m ( 2 m + 2 ) vertices is decomposed into 2 m + 1 commuting strongly regular graphs, which give rise to a symmetric association scheme of class 2 m + 2 − 2 . Furthermore, the eigenmatrices of the symmetric association schemes are determined explicitly. As an application, the eigenmatrix of the commutative strongly regular decomposition obtained from the strongly regular graphs is derived.
[1] E. Bannai,et al. Algebraic Combinatorics I: Association Schemes , 1984 .
[2] E. R. van Dam,et al. Strongly Regular Decompositions of the Complete Graph , 2003 .
[3] Douglas R. Stinson,et al. Combinatorial designs: constructions and analysis , 2003, SIGA.
[4] W. D. Wallis,et al. Construction of strongly regular graphs using affine designs , 1971, Bulletin of the Australian Mathematical Society.