{"id":{"repo_id":"lethbridge","oai_identifier":"oai:opus.uleth.ca:10133/5771"},"canonical_url":"https://search.dev.ndltd.org/etd/lethbridge/oai:opus.uleth.ca:10133/5771","repository":{"repo_id":"lethbridge","name":"University of Lethbridge","base_url":"https://opus.uleth.ca/server/oai/request"},"display":{"title":"Cayley graphs of order 6pq are Hamiltonian","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Maghsoudi, Farzad","University of Lethbridge. Faculty of Arts and Science"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2020,"date_issued":"2020","date_published":"2020","updated_at":"2026-07-27T20:02:38Z","subjects":["Cayley graph","Hamiltonian cycle","Cayley graphs","Hamiltonian graph theory","Graph theory","Dissertations, Academic"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["hdl:10133/5771"],"render_values":[{"text":"hdl:10133/5771","href":null,"code":true}]}]},"links":{"outbound_url":null,"outbound_label":null,"outbound_source":null},"metadata_groups":[{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.issued","label":"Date","values":["2020"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Cayley graph","Hamiltonian cycle","Cayley graphs","Hamiltonian graph theory","Graph theory","Dissertations, Academic"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["hdl:10133/5771"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.other","label":"Dc Description Other","values":["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."]},{"key":"dc:title","label":"Title","values":["Cayley graphs of order 6pq are Hamiltonian"]}]}],"canonical_facts":{"dc:date.issued":["2020"],"dc:description.other":["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."],"dc:identifier":["hdl:10133/5771"],"dc:subject":["Cayley graph","Hamiltonian cycle","Cayley graphs","Hamiltonian graph theory","Graph theory","Dissertations, Academic"],"dc:title":["Cayley graphs of order 6pq are Hamiltonian"],"dc:type":["Thesis"]},"updated_at":"2026-07-27T20:02:38Z"}