Cayley graphs of order 6pq are Hamiltonian

Loading...
Thumbnail Image

Date

Journal Title

Journal ISSN

Volume Title

Publisher

Lethbridge, Alta. : University of Lethbridge, Department of Mathematics and Computer Science

Abstract

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.

Description

Citation

Endorsement

Review

Supplemented By

Referenced By