Enumerating Cayley (di-)graphs on dihedral groups
Abstract
Let p be an odd prime, and D2p= τ,σ τp=σ2=e,στσ=τ-1 the dihedral group of order 2p. In this paper, we provide the number of (connected) Cayley (di-)graphs on D2p up to isomorphism by using the P\'olya enumeration theorem. In the process, we also enumerate (connected) Cayley digraphs on D2p of out-degree k up to isomorphism for each k.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.