Normal Cayley digraphs of dihedral groups with CI-property
Jin-Hua Xie, Yan-Quan Feng, Jin-Xin Zhou

TL;DR
This paper characterizes when dihedral groups are normal Cayley CI-graphs and DCI-graphs, providing a complete classification based on the order of the group, which advances understanding in algebraic graph theory.
Contribution
It proves that dihedral groups are NCI or NDCI if and only if their order meets specific conditions, and classifies dihedral CI and DCI groups based on their order.
Findings
Dihedral groups are NCI or NDCI if and only if n=2,4, or n is odd.
D_{2n} is a DCI-group if n=2 or n is odd-square-free.
D_{2n} is a CI-group if n=2, 9, or n is odd-square-free.
Abstract
A Cayley (di)graph of a group with respect to is said to be normal if the right regular representation of is normal in the automorphism group of , and is called a CI-(di)graph if there is such that , whenever for a Cayley (di)graph . A finite group is called a DCI-group or a NDCI-group if all Cayley digraphs or normal Cayley digraphs of are CI-digraphs, and is called a CI-group or a NCI-group if all Cayley graphs or normal Cayley graphs of are CI-graphs, respectively. Motivated by a conjecture proposed by \'Ad\'am in 1967, CI-groups and DCI-groups have been actively studied during the last fifty years by many researchers in algebraic graph theory. It takes about thirty years to obtain the classification of cyclic CI-groups and DCI-groups, and recently, the first two authors,…
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 · graph theory and CDMA systems
