Metraipolis › archive › dc_da85064df205
Quasi-strongly regular digraphs constructed from transitive groups of degree $n\leq 110$ — arXiv:2609.10075
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.10075
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T10:18:59.576Z
- SHA-256 of the archived text
c315f2437c277e539330c0f64033d2228ee730b850d9fccb86f8fcad29e372ef- Stable URL of this page
https://metraipolis.com/documento/dc_da85064df205
How to cite
Quasi-strongly regular digraphs constructed from transitive groups of degree $n\leq 110$ — arXiv:2609.10075 — arXiv (en), https://arxiv.org/abs/2609.10075 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_da85064df205 (Metraipolis archive dc_da85064df205, sha256 c315f2437c277e539330c0f64033d2228ee730b850d9fccb86f8fcad29e372ef)
BibTeX
@misc{dcda85064df205,
title = {Quasi-strongly regular digraphs constructed from transitive groups of degree $nleq 110$ — arXiv:2609.10075},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.10075},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_da85064df205; sha256 c315f2437c277e539330c0f64033d2228ee730b850d9fccb86f8fcad29e372ef},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.10075. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In this paper we present a method for constructing directed regular graphs from a transitive permutation group. This method is a generalization of a construction method for transitive 1-designs from a finite group, described in \cite{dean1}. Using this construction, we prove the existence of directed strongly regular graphs with parameters $(72,25,15,6,10)$, $(96,11,4,3,1)$, $(96,22,16,8,4)$, $(96,26,11,7,7)$, $(96,29,23,10,8)$, $(96,42,32,16,20)$, $(96,45,35,22,20)$ and $(165,60,36,23,21)$. Finally, we classify quasi-strongly regular digraphs arising from transitive permutation groups of degree at most $30$ and from primitive permutation groups of degrees from $31$ to $110$ and rank at most $30$.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-10 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.10075 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T08:47:06.312Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-10?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).