This Is AuburnElectronic Theses and Dissertations

Show simple item record

Cycle Systems


Metadata FieldValueLanguage
dc.contributor.advisorRodger, Chris
dc.contributor.advisorLindner, Curt
dc.contributor.advisorHoffman, Dean
dc.contributor.advisorJohnson, Pete
dc.contributor.authorSehgal, Nidhi
dc.date.accessioned2012-01-18T21:29:50Z
dc.date.available2012-01-18T21:29:50Z
dc.date.issued2012-01-18
dc.identifier.urihttp://hdl.handle.net/10415/2964
dc.description.abstractIn 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.rightsEMBARGO_NOT_AUBURNen_US
dc.subjectMathematics and Statisticsen_US
dc.titleCycle Systemsen_US
dc.typedissertationen_US
dc.embargo.lengthNO_RESTRICTIONen_US
dc.embargo.statusNOT_EMBARGOEDen_US

Files in this item

Show simple item record