Cycle Systems
Metadata Field | Value | Language |
---|---|---|
dc.contributor.advisor | Rodger, Chris | |
dc.contributor.advisor | Lindner, Curt | |
dc.contributor.advisor | Hoffman, Dean | |
dc.contributor.advisor | Johnson, Pete | |
dc.contributor.author | Sehgal, Nidhi | |
dc.date.accessioned | 2012-01-18T21:29:50Z | |
dc.date.available | 2012-01-18T21:29:50Z | |
dc.date.issued | 2012-01-18 | |
dc.identifier.uri | http://hdl.handle.net/10415/2964 | |
dc.description.abstract | In this dissertation the author has found the necessary and sufficient conditions for obtaining a 6-cycle system of the Cartesian product of two complete graphs covering 2-paths in the corresponding bipartite graph. She has found the maximum fair 6-cycle system as well as 6-cycle system of the Cartesian product of two complete graphs. As a part of this dissertation, the author has also found the necessary and sufficient conditions required to obtain a 4-cycle system of complete graph on n vertices with a nearly 2-regular leave. Finally the author has worked on the problem of finding a 4-cycle system of the line graph of a complete multipartite graph. | en_US |
dc.rights | EMBARGO_NOT_AUBURN | en_US |
dc.subject | Mathematics and Statistics | en_US |
dc.title | Cycle Systems | en_US |
dc.type | dissertation | en_US |
dc.embargo.length | NO_RESTRICTION | en_US |
dc.embargo.status | NOT_EMBARGOED | en_US |