Marshall University
On Hamilton cycle decompositions of complete multipartite graphs which are both cyclic and symmetric
Abstract
dc:description.abstractLet 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.
Degree
thesis:*- Name thesis:degree_name
- Mathematics
- Level thesis:degree_level
- Thesis
- Discipline thesis:degree_discipline
- College of Science
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Akinola, Fatima A.
- Contributors dc:contributor
-
- Dr. Michael Schroeder, Committee Chairperson
- Dr. Elizabeth Niese
- Dr. JiYoon Jung
Subjects
dc:subject × 9Identifiers
dc:identifier.*- Repository record dc:identifier
- https://mds.marshall.edu/etd/1356