Show simple item record

dc.contributor.authorRath, Bijaya
dc.date.accessioned2014-03-04T19:00:05Z
dc.date.available2014-03-04T19:00:05Z
dc.date.issued2010-12
dc.identifier.otherrath_bijaya_201012_ms
dc.identifier.urihttp://purl.galileo.usg.edu/uga_etd/rath_bijaya_201012_ms
dc.identifier.urihttp://hdl.handle.net/10724/26988
dc.description.abstractThis thesis investigates the generation of non-isomorphic simple cubic Cayley graphs. The research is motivated indirectly by the long standing conjecture that all Cayley graphs with at least three vertices are Hamiltonian. All simple cubic Cayley graphs of degree <= 7 were generated. By a simple Cayley graph is meant one for which the underlying Cayley digraph is symmetric and irreflexive. Put another way, each generator is an involution which is not the identity. Results are presented which show which pairs of non-conjugate triples of generators, up to degree 7, yield isomorphic Cayley graphs. These Cayley graphs range in size up to 5040, and include a number for which hamiltonicity or non-hamiltonicity has not been determined. In addition to the census results some sufficient (but by no means necessary) conditions are shown for isomorphism between Cayley graphs, and an efficient method of counting non-conjugate triples of involutions is developed.
dc.languageeng
dc.publisheruga
dc.rightspublic
dc.subjectCayley graphs
dc.subjectHamiltonian graphs
dc.subjectgraph isomorphism
dc.titleGeneration of non-isomorphic cubic Cayley graphs
dc.typeThesis
dc.description.degreeMS
dc.description.departmentComputer Science
dc.description.majorComputer Science
dc.description.advisorRobert Robinson
dc.description.committeeRobert Robinson
dc.description.committeeThiab R. Taha
dc.description.committeeDaniel Everett


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record