Use this URL to cite or link to this record in EThOS:
Title: Automorphisms generating disjoint Hamilton cycles in star graphs
Author: Derakhshan, Parisa
ISNI:       0000 0004 5366 373X
Awarding Body: Loughborough University
Current Institution: Loughborough University
Date of Award: 2015
Availability of Full Text:
Access from EThOS:
Access from Institution:
In the first part of the thesis we define an automorphism φn for each star graph Stn of degree n-1, which yields permutations of labels for the edges of Stn taken from the set of integers {1,..., [n/2c]}. By decomposing these permutations into permutation cycles, we are able to identify edge-disjoint Hamilton cycles that are automorphic images of a known two-labelled Hamilton cycle H1 2(n) in Stn. The search for edge-disjoint Hamilton cycles in star graphs is important for the design of interconnection network topologies in computer science. All our results improve on the known bounds for numbers of any kind of edge-disjoint Hamilton cycles in star graphs.
Supervisor: Not available Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID:  DOI: Not available
Keywords: Star graph ; Hamilton cycle ; Automorphism ; Symmetric group ; Interconnection network topology