English

Construction of directed strongly regular graphs via their orbit matrices and genetic algorithm

Combinatorics 2024-12-20 v1

Abstract

In this paper, we introduce orbit matrices of directed strongly regular graphs (DSRGs). Further, we propose a method of constructing directed strongly regular graphs with prescribed automorphism group using genetic algorithm. In the construction, we use orbit matrices, i.e. quotient matrices related to equitable partitions of adjacency matrices of putative directed strongly regular graphs induced by an action of a prescribed automorphism group. Further, we apply this method to construct directed strongly regular graphs with parameters (36,10,5,2,3)(36,10,5,2,3), (52,12,3,2,3)(52,12,3,2,3), (52,15,6,5,6)(52,15,6,5,6), (55,20,8,6,8)(55,20,8,6,8) and (55,24,12,11,10)(55,24,12,11,10).

Cite

@article{arxiv.2412.14787,
  title  = {Construction of directed strongly regular graphs via their orbit matrices and genetic algorithm},
  author = {Dean Crnković and Andrea Švob and Tin Zrinski},
  journal= {arXiv preprint arXiv:2412.14787},
  year   = {2024}
}

Comments

17 pages

R2 v1 2026-06-28T20:42:08.295Z