Search arXivSearch

arXiv · 2511.04151

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

Abstract

Let $G$ be a finite group and let $S$ be an inverse-closed subset of $G$ not containing the identity. The Cayley graph $\mathrm{Cay}(G,S)$ has vertex set $G$, where two vertices $x$ and $y$ are adjacent if and only if $x^{-1}y \in S$. Kaseasbeh and Erfanian (2021) determined the structure of all Cayley graphs on the dihedral group of order $2n$ for subsets $S$ of size at most three. We extend their work by analyzing the structure of such Cayley graphs for subsets $S$ 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 $2p$, where $p$ ranges over infinitely many primes and $S$ consists only of rotations; 2. if $S$ consists of $4 \le 2k < n$ distinct rotations, then the Cayley graph $\mathrm{Cay}(D_{2n},S)$ is the disjoint union of two isomorphic circulant graphs on $n$ vertices, and 3. if $S$ is a generating set of $4\leq k\leq n$ reflections, then the Cayley graph $\mathrm{Cay}(D_{2n},S)$ is bipartite, forming the disjoint union of $k$ perfect matchings.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Amitayu Banerjee. 2026-01-05. Automorphism Groups and Structure of 4-Valent Cayley Graphs on Dihedral Groups. https://arxiv.org/abs/2511.04151

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO