Strongly regular decompositions and symmetric association schemes of a power of two
Abstract
For any positive integer m, the complete graph on 22m(2m+2) vertices is decomposed into 2m+1 commuting strongly regular graphs, which give rise to a symmetric association scheme of class 2m+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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.