Infinitely many nonsolvable groups whose Cayley graphs are hamiltonian

Authors

  • Dave Witte Morris Department of Mathematics and Computer Science, University of Lethbridge, Canada ROR

Keywords:

Cayley graph, Hamiltonian cycle, Solvable group, Alternating group

Abstract

We show 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, we show that if $A_5$~is the alternating group on five letters, and $p$~is any prime, such that $p \equiv 1 \pmod{30}$, then every connected Cayley graph on the direct product $A_5 \times \integer _p$ has a hamiltonian cycle.

Downloads

Download data is not yet available.

References

R. Gould and R. Roth, Cayley digraphs and $(1, j, n)$-sequencings of the alternating groups $A_n$, Discrete Math. 66(1-2) (1987) 91-102.

K. Kutnar, D. Marušič, D. W. Morris, J. Morris, and P. Šparl, Hamiltonian cycles in Cayley graphs whose order has few prime factors, Ars Math. Contemp. 5(1) (2012) 27-71.

K. Kutnar, D. Marušič, D. W. Morris, J. Morris, and P. Šparl, Cayley graphs on $A_5$ are hamiltonian, unpublished appendix to [2], http://arxiv.org/src/1009.5795/anc/A5.pdf.

D. Witte and J. A. Gallian, A survey: Hamiltonian cycles in Cayley graphs, Discrete Math. 51(3) (1984) 293-304.

Downloads

Published

2016-01-15

How to Cite

Morris, D. W. (2016). Infinitely many nonsolvable groups whose Cayley graphs are hamiltonian. Journal of Algebra Combinatorics Discrete Structures and Applications, 3(1), 13–30. Retrieved from https://jacodesmath.com/index.php/jacodesmath/article/view/26

Issue

Section

Articles