Abstract
dc:description.abstractA k-cycle decomposition of order n is a partition of the edges of the complete graph on n vertices into k-cycles. In this report a backtracking algorithm is developed to count the number of inequivalent k-cycle decompositions of order n.
Degree
thesis:*- Name thesis:degree_name
- Master of Science in Mathematical Sciences (MS)
- Level thesis:degree_level
- Master's report
- Discipline thesis:degree_discipline
- Department of Mathematical Sciences
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Laffin, William J.
- Contributors dc:contributor
-
- Donald L. Kreher
Subjects
dc:subject × 2Identifiers
dc:identifier.*- Identifier
- https://digitalcommons.mtu.edu/etds/548