Hamiltonicity of certain vertex symmetric graphs

dc.contributor.author	Jiang, Ming	en_US
dc.date.accessioned	2024-08-14T17:56:03Z
dc.date.available	2024-08-14T17:56:03Z
dc.date.copyright	1992	en_US
dc.date.issued	1992
dc.degree.department	Department of Computer Science
dc.degree.level	Master of Science M.Sc.	en
dc.description.abstract	Vertex symmetric graphs play an important role in the design of parallel architectures. In this thesis, we study Hamiltonicity in specific families of Cayley graphs and vertex symmetric graphs. In the first part of the thesis, we study the Hamiltonicity in Faber-Moore digraphs. Faber-Moore digraphs have been proposed as a method of efficient parallel architectures in which information flows unidirectionally. We prove that every Faber-Moore digraph is Hamiltonian. In addition, we give a sufficient and necessary condition for the existence of Hamilton path between any pair of vertices. In the second part of the thesis, we give an efficient algorithm to generate permutations by a tree of transpositions. This algorithm finds Hamilton paths in the corresponding tree Cayley graphs. We give some open problems in the last part of the thesis.	en
dc.format.extent	65 pages
dc.identifier.uri	https://hdl.handle.net/1828/18357
dc.rights	Available to the World Wide Web	en_US
dc.subject	UN SDG 11: Sustainable Cities and Communities	en
dc.title	Hamiltonicity of certain vertex symmetric graphs	en_US
dc.type	Thesis	en_US

Files

Now showing 1 - 1 of 1