Enumerating Cayley (di-)graphs on dihedral groups

preprint2016arXivOpen access

Abstract

Let pp be an odd prime, and D2p=⟨τ,σ∣τp=σ2=e,στσ=τ−1⟩D_{2p}=\langle τ,σ\mid τ^p=σ^2=e,στσ=τ^{-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ó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.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.