Date of Award
2011
Document Type
Master's report
Degree Name
Master of Science in Mathematical Sciences (MS)
College, School or Department Name
Department of Mathematical Sciences
Advisor
Donald L. Kreher
Abstract
A 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.
Recommended Citation
Laffin, William J., "Enumeration of inequivalent cycle decompositions", Master's report, Michigan Technological University, 2011.