English

Finite $s$-geodesic-transitive digraphs

Combinatorics 2023-03-15 v1

Abstract

This paper initiates the investigation of the family of (G,s)(G,s)-geodesic-transitive digraphs with s2s\geq 2. We first give a global analysis by providing a reduction result. Let Γ\Gamma be such a digraph and let NN be a normal subgroup of GG maximal with respect to having at least 33 orbits. Then the quotient digraph ΓN\Gamma_N is (G/N,s)(G/N,s')-geodesic-transitive where s=min{s,\diam(ΓN)}s'=\min\{s,\diam(\Gamma_N)\}, G/NG/N is either quasiprimitive or bi-quasiprimitive on V(ΓN)V(\Gamma_N), and ΓN\Gamma_N is either directed or an undirected complete graph. Moreover, it is further shown that if Γ\Gamma is not (G,2)(G,2)-arc-transitive, then G/NG/N is quasiprimitive on V(ΓN)V(\Gamma_N). On the other hand, we also consider the case that the normal subgroup NN of GG has one orbit on the vertex set. We show that if NN is regular on V(Γ)V(\Gamma), then Γ\Gamma is a circuit, and particularly each (G,s)(G,s)-geodesic-transitive normal Cayley digraph with s2s\geq 2, is a circuit. Finally, we investigate (G,2)(G,2)-geodesic-transitive digraphs with either valency at most 5 or diameter at most 2. Let Γ\Gamma be a (G,2)(G,2)-geodesic-transitive digraph. It is proved that: if Γ\Gamma has valency at most 55, then Γ\Gamma is (G,2)(G,2)-arc-transitive; if Γ\Gamma has diameter 22, then Γ\Gamma is a balanced incomplete block design with the Hadamard parameters.

Keywords

Cite

@article{arxiv.2303.07681,
  title  = {Finite $s$-geodesic-transitive digraphs},
  author = {Wei Jin},
  journal= {arXiv preprint arXiv:2303.07681},
  year   = {2023}
}
R2 v1 2026-06-28T09:15:42.639Z