Enumeration of inequivalent cycle decompositions
| Data(s) |
01/01/2011
|
|---|---|
| Resumo |
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. |
| Formato |
application/pdf |
| Identificador |
http://digitalcommons.mtu.edu/etds/548 http://digitalcommons.mtu.edu/cgi/viewcontent.cgi?article=1547&context=etds |
| Publicador |
Digital Commons @ Michigan Tech |
| Fonte |
Dissertations, Master's Theses and Master's Reports - Open |
| Palavras-Chave | #Mathematics #Physical Sciences and Mathematics |
| Tipo |
text |
