Resumen de On Hamilton circuits in Cayley digraphs over generalized dihedral groups

Adrián Pastine, Daniel Jaume

• In this paper we prove that given a generalized dihedral group DH and a generating subset S, if S ∩ H = ∅ then the Cayley digraph Cay(DH, S) is Hamiltonian. The proof we provide is via a recursive algorithm that produces a Hamilton circuit in the digraph.