Cayley graphs of order 6pq are Hamiltonian
No Thumbnail Available
University of Lethbridge. Faculty of Arts and Science
Lethbridge, Alta. : University of Lethbridge, Department of Mathematics and Computer Science
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.
Cayley graph , Hamiltonian cycle , Cayley graphs , Hamiltonian graph theory , Graph theory , Dissertations, Academic