Enumerating Cayley (di-)graphs on dihedral groups
Xueyi Huang, Qiongxiang Huang

TL;DR
This paper counts the number of Cayley and Cayley di-graphs on dihedral groups of order 2p, using Pólya enumeration, including connected graphs and digraphs with specified out-degree.
Contribution
It provides explicit enumeration formulas for Cayley (di-)graphs on dihedral groups, including connected cases and out-degree specific digraphs, up to isomorphism.
Findings
Number of Cayley and Cayley di-graphs on D_{2p} up to isomorphism.
Enumeration of connected Cayley (di-)graphs.
Counting Cayley digraphs with fixed out-degree k.
Abstract
Let be an odd prime, and the dihedral group of order . In this paper, we provide the number of (connected) Cayley (di-)graphs on up to isomorphism by using the P\'{o}lya enumeration theorem. In the process, we also enumerate (connected) Cayley digraphs on of out-degree up to isomorphism for each .
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 · Coding theory and cryptography
