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

TL;DR
This paper extends the understanding of 4-valent Cayley graphs on dihedral groups by analyzing their structure and automorphism groups for larger generating sets, revealing their decomposition into circulant graphs and perfect matchings.
Contribution
It provides new structural and automorphism group results for Cayley graphs on dihedral groups with larger generating sets, building on prior work limited to smaller subsets.
Findings
Automorphism groups determined for dihedral groups of order 2p with rotation-only sets.
Cayley graphs with certain rotation sets decompose into two isomorphic circulant graphs.
Graphs generated by multiple reflections are bipartite and consist of disjoint perfect matchings.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Limits and Structures in Graph Theory · Geometric and Algebraic Topology
