Cayley graphs of order 27p are hamiltonian
Combinatorics
2011-04-22 v3
Abstract
Suppose G is a finite group, such that |G| = 27p, where p is prime. We show that if S is any generating set of G, then there is a hamiltonian cycle in the corresponding Cayley graph Cay(G;S).
Cite
@article{arxiv.1101.4322,
title = {Cayley graphs of order 27p are hamiltonian},
author = {Ebrahim Ghaderpour and Dave Witte Morris},
journal= {arXiv preprint arXiv:1101.4322},
year = {2011}
}
Comments
13 pages, no figures; minor revisions, including suggestions from a referee; this version is to appear in the International Journal of Combinatorics