Cayley graphs of order 8pq are hamiltonian
Combinatorics
2026-04-21 v2
Abstract
We give a computer-assisted proof that if is a finite group of order , where and are distinct primes, then every connected Cayley graph on has a hamiltonian cycle.
Cite
@article{arxiv.2304.03348,
title = {Cayley graphs of order 8pq are hamiltonian},
author = {Fateme Abedi and Dave Witte Morris and Javanshir Rezaee and M. Reza Salarian},
journal= {arXiv preprint arXiv:2304.03348},
year = {2026}
}
Comments
23 pages. GAP computer programs in the ancillary files directory. v2: updated the url of the source code