Search arXivSearch

arXiv · 2604.04366

On arc-transitive inner-automorphic Cayley graphs on dihedral groups

Abstract

A Cayley graph $\Cay(G,S)$ is said to be inner-automorphic if $S$ is a union of conjugacy classes of a group $G$, and arc-transitive if its full automorphism group acts transitively on the set of arcs. In this paper, we characterize four well-known families of arc-transitive graphs that arise as connected inner-automorphic Cayley graphs on dihedral groups, and we provide a necessary condition for other connected arc-transitive Cayley graphs on dihedral groups to be inner-automorphic. We further construct an infinite family of examples satisfying this condition, thereby demonstrating the existence of such graphs. Finally, we complete the classification of all 2-distance-transitive connected inner-automorphic Cayley graphs on dihedral groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Jun-Jie Huang, Jin-Hua Xie. 2026-04-06. On arc-transitive inner-automorphic Cayley graphs on dihedral groups. https://arxiv.org/abs/2604.04366

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR