English

Enumerating Cayley (di-)graphs on dihedral groups

Combinatorics 2016-12-13 v1

Abstract

Let pp be an odd prime, and D2p=τ,στp=σ2=e,στσ=τ1D_{2p}=\langle \tau,\sigma\mid \tau^p=\sigma^2=e,\sigma\tau\sigma=\tau^{-1}\rangle the dihedral group of order 2p2p. In this paper, we provide the number of (connected) Cayley (di-)graphs on D2pD_{2p} up to isomorphism by using the P\'{o}lya enumeration theorem. In the process, we also enumerate (connected) Cayley digraphs on D2pD_{2p} of out-degree kk up to isomorphism for each kk.

Keywords

Cite

@article{arxiv.1612.03579,
  title  = {Enumerating Cayley (di-)graphs on dihedral groups},
  author = {Xueyi Huang and Qiongxiang Huang},
  journal= {arXiv preprint arXiv:1612.03579},
  year   = {2016}
}

Comments

14 pages, 0 figure

R2 v1 2026-06-22T17:20:16.043Z