Odd-order Cayley graphs with commutator subgroup of order pq are hamiltonian

2012/05/01 by Dave Witte Morris, Morris, Dave Witte · 1 citation
Mathematics · Computer Science · #Graph theory and applications #Finite Group Theory Research #Advanced Graph Theory Research

paper · pdf · doi:10.48550/arxiv.1205.0087

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ⁿ, where p and q are prime, then every connected Cayley graph on G has a hamiltonian cycle.

Cited by

• Hamiltonian cycles in Cayley graphs of imprimitive complex reflection\n groups

Related

• Cayley graphs on groups with commutator subgroup of order 2p are hamiltonian
• On hamiltonian cycles in Cayley graphs of order pqrs
• Cayley graphs on nilpotent groups with cyclic commutator subgroup are hamiltonian
• Cayley graphs of order 8pq are hamiltonian
• Cayley Graphs Of Order pqrs Are Hamiltonian