Small vertex-transitive directed strongly regular graphs

Research output: Contribution to journalArticlepeer-review

19 Scopus citations


We consider directed strongly regular graphs defined in 1988 by Duval. All such graphs with n vertices, n ≤ 20, having a vertex-transitive automorphism group, are determined with the aid of a computer. As a consequence, we prove the existence of directed strongly regular graphs for three feasible parameter sets listed by Duval. For one parameter set a computer-free proof of the nonexistence is presented. This, together with a recent result by Jørgensen, gives a complete answer on Duval's question about the existence of directed strongly regular graphs with n ≤ 20. The paper includes catalogues of all generated graphs and certain theoretical generalizations based on some known and new graphs.

Original languageEnglish
Pages (from-to)87-115
Number of pages29
JournalDiscrete Mathematics
Issue number1-3
StatePublished - 28 Aug 2002


  • Coherent algebra
  • Computer enumeration
  • Directed strongly regular graph
  • Transitive permutation group

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Small vertex-transitive directed strongly regular graphs'. Together they form a unique fingerprint.

Cite this