Hamiltonian cycles in Cayley graphs whose order has few prime factors
DOI:
https://doi.org/10.26493/1855-3974.177.341Keywords:
Cayley graphs, hamiltonian cyclesAbstract
We prove that if Cay(G; S) is a connected Cayley graph with n vertices, and the prime factorization of n is very small, then Cay(G; S) has a hamiltonian cycle. More precisely, if p, q, and r are distinct primes, then n can be of the form kp with 24 ≠ k < 32, or of the form kpq with k ≤ 5, or of the form pqr, or of the form kp2 with k ≤ 4, or of the form kp3 with k ≤ 2.Downloads
Published
2011-10-12
Issue
Section
Articles
License
Articles in this journal are published under Creative Commons Attribution 4.0 International License
https://creativecommons.org/licenses/by/4.0/