Sporadic examples of directed strongly regular graphs obtained by computer algebra experimentation
From MaRDI portal
Publication:2879322
Abstract: We report about the results of the application of modern computer algebra tools for construction of directed strongly regular graphs. The suggested techniques are based on the investigation of non-commutative association schemes and Cayley graphs over non-Abelian groups. We demonstrate examples of directed strongly regular graphs for 28 different parameter sets, for which the existence of a corresponding digraph has not been known before.
Recommendations
- Two kinds of constructions of directed strongly regular graphs
- Semidirect product constructions of directed strongly regular graphs
- Directed strongly regular graphs obtained from coherent algebras
- Directed strongly regular graphs with \(\mu=\lambda\)
- A note on a family of directed strongly regular graphs
Cited in
(8)- Computing distance-regular graph and association scheme parameters in \texttt{SageMath} with \texttt{sage}-\texttt{drg}
- A Class of Association Schemes and Their Automorphisms
- New tools for the construction of directed strongly regular graphs: difference digraphs and partial sum families
- Infinite families of directed strongly regular graphs using equitable partitions
- Directed strongly regular graphs obtained from coherent algebras
- Semidirect product constructions of directed strongly regular graphs
- A note on directed strongly regular graphs
- Examples of computer experimentation in algebraic combinatorics
This page was built for publication: Sporadic examples of directed strongly regular graphs obtained by computer algebra experimentation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2879322)