Back to search

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

Cayley graphs of order 6pq are Hamiltonian

Abstract

dc:description.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.

Degree

thesis:*
Level thesis:degree_level
Masters
Grantor dc:publisher
Lethbridge, Alta. : University of Lethbridge, Department of Mathematics and Computer Science
Year dc:date.issued
2020

Author and committee

dc:creator, dc:contributor.*
Authors dc:creator
  • Maghsoudi, Farzad
  • University of Lethbridge. Faculty of Arts and Science
Advisors dc:contributor.supervisor
  • Morris, Joy
  • Morris, Dave W.

Subjects

dc:subject × 6

Rights

Language dc:language.iso
en

Identifiers

dc:identifier.*
Handle dc:identifier.uri
https://hdl.handle.net/10133/5771

Chain of custody

source
Harvested from
University of Lethbridge
Base URL
opus.uleth.ca/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Maghsoudi, Farzad; University of Lethbridge. Faculty of Arts and Science. Cayley graphs of order 6pq are Hamiltonian. Masters thesis, Lethbridge, Alta. : University of Lethbridge, Department of Mathematics and Computer Science, 2020. https://hdl.handle.net/10133/5771