Cayley graphs of order 6pq are Hamiltonian

Simple item page
dc.contributor.authorMaghsoudi, Farzad
dc.contributor.authorUniversity of Lethbridge. Faculty of Arts and Science
dc.contributor.supervisorMorris, Joy
dc.contributor.supervisorMorris, Dave Witte
dc.date.accessioned2020-09-24T16:19:17Z
dc.date.available2020-09-24T16:19:17Z
dc.date.issued2020
dc.degree.levelMastersen_US
dc.description.abstractAssume 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.en_US
dc.identifier.urihttps://hdl.handle.net/10133/5771
dc.language.isoenen_US
dc.proquest.subject0405en_US
dc.proquestyesYesen_US
dc.publisherLethbridge, Alta. : University of Lethbridge, Department of Mathematics and Computer Scienceen_US
dc.publisher.departmentDepartment of Mathematics and Computer Scienceen_US
dc.publisher.facultyArts and Scienceen_US
dc.relation.ispartofseriesThesis (University of Lethbridge. Faculty of Arts and Science)en_US
dc.subjectCayley graphen_US
dc.subjectHamiltonian cycleen_US
dc.subjectCayley graphsen_US
dc.subjectHamiltonian graph theoryen_US
dc.subjectGraph theoryen_US
dc.subjectDissertations, Academicen_US
dc.titleCayley graphs of order 6pq are Hamiltonianen_US
dc.typeThesisen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
MAGHSOUDI_FARZAD_MSC_2020.pdf
Size:
634.11 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
3.25 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Arts and Science, Faculty of
University of Lethbridge Theses