Enumerating Cayley (di-)graphs on dihedral groups
Combinatorics
2016-12-13 v1
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 .
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