Strongly regular decompositions and symmetric association schemes of a power of two
classification
🧮 math.CO
keywords
regularstronglyassociationsymmetricgraphsschemesapplicationclass
read the original abstract
For any positive integer $m$, the complete graph on $2^{2m}(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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.