Sporadic Examples of Directed Strongly Regular Graphs Obtained by Computer Algebra Experimentation (Extended version)
Combinatorics
2015-03-30 v1
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.
Keywords
Cite
@article{arxiv.1408.2127,
title = {Sporadic Examples of Directed Strongly Regular Graphs Obtained by Computer Algebra Experimentation (Extended version)},
author = {Štefan Gyürki and Mikhail Klin},
journal= {arXiv preprint arXiv:1408.2127},
year = {2015}
}
Comments
21 pages