Metraipolis › archive › dc_e1094ab8a536
An infinite family of intransitive directed strongly regular graphs with rank 6 Weisfeiler--Leman closure — arXiv:2609.25282
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.25282
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T15:55:49.370Z
- SHA-256 of the archived text
6b786fcad395bfc65ff48f8200016aa0926236c01cbd798db00a7d1d92d4b7b3- Stable URL of this page
https://metraipolis.com/documento/dc_e1094ab8a536
How to cite
An infinite family of intransitive directed strongly regular graphs with rank 6 Weisfeiler--Leman closure — arXiv:2609.25282 — arXiv (en), https://arxiv.org/abs/2609.25282 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e1094ab8a536 (Metraipolis archive dc_e1094ab8a536, sha256 6b786fcad395bfc65ff48f8200016aa0926236c01cbd798db00a7d1d92d4b7b3)
BibTeX
@misc{dce1094ab8a536,
title = {An infinite family of intransitive directed strongly regular graphs with rank 6 Weisfeiler--Leman closure — arXiv:2609.25282},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.25282},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e1094ab8a536; sha256 6b786fcad395bfc65ff48f8200016aa0926236c01cbd798db00a7d1d92d4b7b3},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.25282. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We construct an infinite family of directed strongly regular graphs (DSRGs) with intransitive full automorphism groups whose Weisfeiler--Leman closure are association schemes of rank 6. This is the smallest possible rank for an association scheme admitting a proper DSRG merging. We also exhibit rigid sporadic DSRGs with the same closure property, showing that combinatorial regularity, group-theoretic symmetry, and Weisfeiler--Leman regularity capture fundamentally different aspects of graph structure. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-23 in math.CO). Categorie arXiv: Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2609.25282 — 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-08T15:16:21.668Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-23?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).