paper

Automorphism Groups and Structure of 4-Valent Cayley Graphs on Dihedral Groups

arXiv:2511.04151

Abstract

Let be a finite group and let be an inverse-closed subset of not containing the identity. The Cayley graph has vertex set , where two vertices and are adjacent if and only if . Kaseasbeh and Erfanian (2021) determined the structure of all Cayley graphs on the dihedral group of order for subsets of size at most three. We extend their work by analyzing the structure of such Cayley graphs for subsets of size at least four. Our main results are as follows: 1. using a classical result of Burnside and Schur, we determine the automorphism groups of Cayley graphs on dihedral groups of order , where ranges over infinitely many primes and consists only of rotations; 2. if consists of distinct rotations, then the Cayley graph is the disjoint union of two isomorphic circulant graphs on vertices, and 3. if is a generating set of reflections, then the Cayley graph is bipartite, forming the disjoint union of perfect matchings.

arXiv comment12 pages, 3 figures, Abstract accepted for presentation at RACMAS 2026, submitted to the RACMAS 2026 proceedings