Back to search

Michigan Technological University

Enumeration of inequivalent cycle decompositions

Abstract

dc:description.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.

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 × 2

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
Michigan Technological University
Base URL
digitalcommons.mtu.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Laffin, William J.. Enumeration of inequivalent cycle decompositions. Master's report thesis, https://doi.org/10.37099/mtu.dc.etds/548