Odd-order Cayley graphs with commutator subgroup of order pq are hamiltonian
classification
🧮 math.CO
keywords
ordercayleycommutatorhamiltoniansubgroupconnectedcyclecyclic
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.