On arc-transitive inner-automorphic Cayley graphs on dihedral groups
Group Theory
2026-04-07 v1 Combinatorics
Abstract
A Cayley graph is said to be inner-automorphic if is a union of conjugacy classes of a group , 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.
Cite
@article{arxiv.2604.04366,
title = {On arc-transitive inner-automorphic Cayley graphs on dihedral groups},
author = {Jun-Jie Huang and Jin-Hua Xie},
journal= {arXiv preprint arXiv:2604.04366},
year = {2026}
}