Odd-order Cayley graphs with commutator subgroup of order pq are hamiltonian
Combinatorics
2012-05-02 v1
Abstract
We show that if G is a nontrivial, finite group of odd order, whose commutator subgroup [G,G] is cyclic of order p^m q^n, where p and q are prime, then every connected Cayley graph on G has a hamiltonian cycle.
Cite
@article{arxiv.1205.0087,
title = {Odd-order Cayley graphs with commutator subgroup of order pq are hamiltonian},
author = {Dave Witte Morris},
journal= {arXiv preprint arXiv:1205.0087},
year = {2012}
}
Comments
32 pages