{"id":{"repo_id":"marshall","oai_identifier":"oai:mds.marshall.edu:etd-2361"},"canonical_url":"https://search.ndltd.org/etd/marshall/oai:mds.marshall.edu:etd-2361","repository":{"repo_id":"marshall","name":"Marshall University","base_url":"https://mds.marshall.edu/do/oai/"},"display":{"title":"On Hamilton cycle decompositions of complete multipartite graphs which are both cyclic and symmetric","abstract":"Let G be a graph with v vertices. A Hamilton cycle of a graph is a collection of edges which create a cycle using every vertex. A Hamilton cycle decomposition is cyclic if the set of cycle is invariant under a full length permutation of the vertex set. We say a decomposition is symmetric if all the cycles are invariant under an appropriate power of the full length permutation. Such decompositions are known to exist for complete graphs and families of other graphs. In this work, we show the existence of cyclic n-symmetric Hamilton cycle decompositions of a family of graphs, the complete multipartite graph Km×n where the number of parts, m, is odd and the part size, n, is also odd. We classify the existence where m is prime and prove the existence in additional cases where m is a composite odd integer.","abstract_html":"Let G be a graph with v vertices. A Hamilton cycle of a graph is a collection of edges which create a cycle using every vertex. A Hamilton cycle decomposition is cyclic if the set of cycle is invariant under a full length permutation of the vertex set. We say a decomposition is symmetric if all the cycles are invariant under an appropriate power of the full length permutation. Such decompositions are known to exist for complete graphs and families of other graphs. In this work, we show the existence of cyclic n-symmetric Hamilton cycle decompositions of a family of graphs, the complete multipartite graph Km×n where the number of parts, m, is odd and the part size, n, is also odd. We classify the existence where m is prime and prove the existence in additional cases where m is a composite odd integer.","abstract_has_math":false,"creators":["Akinola, Fatima A."],"institution":null,"degree_name":"Mathematics","degree_level":"Thesis","degree_discipline":"College of Science","degree_department":null,"school":null,"contributors":["Dr. Michael Schroeder, Committee Chairperson","Dr. Elizabeth Niese","Dr. JiYoon Jung"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-21T19:57:20Z","subjects":["Discrete Mathematics and Combinatorics","Mathematics","Physical Sciences and Mathematics","cyclic","decomposition","graphs","Hamilton","multipartite","symmetric"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://mds.marshall.edu/etd/1356","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://mds.marshall.edu/etd/1356","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://mds.marshall.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Amds.marshall.edu%3Aetd-2361","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Dr. Michael Schroeder, Committee Chairperson","Dr. Elizabeth Niese","Dr. JiYoon Jung"]},{"key":"dc:creator","label":"Author","values":["Akinola, Fatima A."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2021-11-03T07:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2021-01-01T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["College of Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Mathematics"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Discrete Mathematics and Combinatorics","Mathematics","Physical Sciences and Mathematics","cyclic","decomposition","graphs","Hamilton","multipartite","symmetric"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://mds.marshall.edu/etd/1356"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Let G be a graph with v vertices. A Hamilton cycle of a graph is a collection of edges which create a cycle using every vertex. A Hamilton cycle decomposition is cyclic if the set of cycle is invariant under a full length permutation of the vertex set. We say a decomposition is symmetric if all the cycles are invariant under an appropriate power of the full length permutation. Such decompositions are known to exist for complete graphs and families of other graphs. In this work, we show the existence of cyclic n-symmetric Hamilton cycle decompositions of a family of graphs, the complete multipartite graph Km×n where the number of parts, m, is odd and the part size, n, is also odd. We classify the existence where m is prime and prove the existence in additional cases where m is a composite odd integer."]},{"key":"dc:title","label":"Title","values":["On Hamilton cycle decompositions of complete multipartite graphs which are both cyclic and symmetric"]}]}],"canonical_facts":{"dc:contributor":["Dr. Michael Schroeder, Committee Chairperson","Dr. Elizabeth Niese","Dr. JiYoon Jung"],"dc:creator":["Akinola, Fatima A."],"dc:date.available":["2021-11-03T07:00:00Z"],"dc:date.created":["2021-01-01T08:00:00Z"],"dc:description.abstract":["Let G be a graph with v vertices. A Hamilton cycle of a graph is a collection of edges which create a cycle using every vertex. A Hamilton cycle decomposition is cyclic if the set of cycle is invariant under a full length permutation of the vertex set. We say a decomposition is symmetric if all the cycles are invariant under an appropriate power of the full length permutation. Such decompositions are known to exist for complete graphs and families of other graphs. In this work, we show the existence of cyclic n-symmetric Hamilton cycle decompositions of a family of graphs, the complete multipartite graph Km×n where the number of parts, m, is odd and the part size, n, is also odd. We classify the existence where m is prime and prove the existence in additional cases where m is a composite odd integer."],"dc:identifier":["https://mds.marshall.edu/etd/1356"],"dc:subject":["Discrete Mathematics and Combinatorics","Mathematics","Physical Sciences and Mathematics","cyclic","decomposition","graphs","Hamilton","multipartite","symmetric"],"dc:title":["On Hamilton cycle decompositions of complete multipartite graphs which are both cyclic and symmetric"],"thesis:degree_discipline":["College of Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Mathematics"]},"updated_at":"2026-11-21T19:57:20Z"}