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 noncommutative 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. © 2014 Springer International Publishing.
Cite
CITATION STYLE
Gyürki, Š., & Klin, M. (2014). Sporadic examples of directed strongly regular graphs obtained by computer algebra experimentation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8660 LNCS, pp. 155–170). Springer Verlag. https://doi.org/10.1007/978-3-319-10515-4_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
