Cayley graphs of order 6pq are Hamiltonian

Assume G is a finite group, such that |G| is either 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 on G with connecting set S.

Authors

• Maghsoudi, Farzad
• University of Lethbridge. Faculty of Arts and Science

• Cayley graph
• Hamiltonian cycle
• Cayley graphs
• Hamiltonian graph theory
• Graph theory
• Dissertations, Academic

Identifier

hdl:10133/5771

OAI identifier oai:identifier

oai:opus.uleth.ca:10133/5771