Infinitely many nonsolvable groups whose Cayley graphs are Hamiltonian

MaRDI QIDQ5241110zbMATH OpenFDO

Authors David Witte Morris

Publication date 30 October 2019

Full work available at URL https://arxiv.org/abs/1507.04973

zbMATH Keywords

Hamiltonian cycleCayley graphalternating groupsolvable group

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Abstract: This note shows there are infinitely many finite groups G, such that every connected Cayley graph on G has a hamiltonian cycle, and G is not solvable. Specifically, for every prime p that is congruent to 1, modulo 30, we show there is a hamiltonian cycle in every connected Cayley graph on the direct product of the cyclic group of order p with the alternating group A_5 on five letters.

Recommendations

• 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 \(6pq\) and \(7pq\) are Hamiltonian
• Odd-order Cayley graphs with commutator subgroup of order pq are hamiltonian

Cites work

• A survey: Hamiltonian cycles in Cayley graphs
• Cayley digraphs and (1,j,n)-sequencings of the alternating groups \(A_ n\)
• Hamiltonian cycles in Cayley graphs whose order has few prime factors

Cited in

(5)

• Cayley graphs of order \(kp\) are Hamiltonian for \(k < 48\)
• The cyclomatic number of connected graphs without solvable orbits
• A survey on Hamiltonicity in Cayley graphs and digraphs on different groups
• A complete classification of which (n,k)-star graphs are Cayley graphs
• Cayley graphs on nilpotent groups with cyclic commutator subgroup are Hamiltonian

This page was built for publication: Infinitely many nonsolvable groups whose Cayley graphs are Hamiltonian

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5241110)