Dihedral Hamiltonian Cycle Systems of the Cocktail Party Graph

Abstract

AbstractThe existence problem for a Hamiltonian cycle decomposition of (the so called cocktail party graph) with a dihedral automorphism group acting sharply transitively on the vertices is completely solved. Such Hamiltonian cycle decompositions exist for all even n while, for n odd, they exist if and only if the following conditions hold: (i) n is not a prime power; (ii) there is a suitable ℓ such that (mod 2ℓ) for all prime factors p of n and the number of the prime factors (counted with their respective multiplicities) such that (mod ) is even. Thus in particular one has a dihedral Hamiltonian cycle decomposition of the cocktail party graph on 8k vertices for all k, while it is known that no such cyclic Hamiltonian cycle decomposition exists. Finally, this paper touches on a recently introduced symmetry requirement by proving that there exists a dihedral and symmetric Hamiltonian cycle system of if and only if (mod 4).