English

Cayley graphs of order 6pq are Hamiltonian

Combinatorics 2025-09-30 v4

Abstract

Assume G is a finite group, such that |G|= 6pq or 7pq, where p and q are distinct prime numbers, and let S be a generating set of G. We prove there is a Hamiltonian cycle in the corresponding Cayley graph Cay(G;S).

Keywords

Cite

@article{arxiv.2009.10055,
  title  = {Cayley graphs of order 6pq are Hamiltonian},
  author = {Farzad Maghsoudi},
  journal= {arXiv preprint arXiv:2009.10055},
  year   = {2025}
}