Metraipolis › archive › dc_88f7ee73ef0e

On 2-distance-transitive circulant digraphs — arXiv:2609.19734

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.19734
License (as archived)
CC0-1.0
Archived
2026-10-10T04:47:04.297Z
SHA-256 of the archived text
9b28d24d5650d071578593de2fe425acf3a7cb078ddc26dd04ae328e6f968e35
Stable URL of this page
https://metraipolis.com/documento/dc_88f7ee73ef0e

How to cite

On 2-distance-transitive circulant digraphs — arXiv:2609.19734 — arXiv (en), https://arxiv.org/abs/2609.19734 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_88f7ee73ef0e (Metraipolis archive dc_88f7ee73ef0e, sha256 9b28d24d5650d071578593de2fe425acf3a7cb078ddc26dd04ae328e6f968e35)
BibTeX
@misc{dc88f7ee73ef0e,
  title = {On 2-distance-transitive circulant digraphs — arXiv:2609.19734},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.19734},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_88f7ee73ef0e; sha256 9b28d24d5650d071578593de2fe425acf3a7cb078ddc26dd04ae328e6f968e35},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.19734. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Circulant digraphs form a prominent class of Cayley digraphs defined on finite cyclic groups. Building on the existing classification of $2$-arc-transitive circulant graphs, this paper presents a complete classification of $2$-distance-transitive circulant digraphs. Our main theorem establishes that every connected $2$-distance-transitive circulant digraph is isomorphic to one of the following: the undirected cycle $C_n$, the complete bipartite graph $\K_{\frac{n}{2},\frac{n}{2}}$, the complete multipartite graph $\K_{m[b]}$ with $m\geq 3,b\geq 2$, the graph $\K_{\frac{n}{2},\frac{n}{2}}-\frac{n}{2}\K_2$ for odd $\frac{n}{2}$, prime-order Paley graphs, the directed cycle $\overrightarrow{C}_n$, the oriented graph \(G(p^m,r)\) satisfying Condition~\ref{p-power-normal-2dt-cond}, the oriented graph \( C_r(b,1)\) with $r\geq 3,b\geq 2$ and $rb=n$, the lexicographic product oriented graph \( G(p^m,r)[\overline{\K}_d]\) where \(G(p^m,r)\) obeys Condition~\ref{p-power-normal-2dt-cond}.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-18 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.19734 — 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-10T04:15:33.125Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).