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ólya enumeration theorem. In the process, we also enumerate (connected) Cayley digraphs on of out-degree up to isomorphism for each .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.