Automorphisms generating disjoint Hamilton cycles in star graphs

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, . . . , bn/2c}. By decomposing these permutations into permutation cycles, we are able to identify edge-di...

Full description

Bibliographic Details

Main Author:	Parisa Derakhshan
Format:	Default Thesis
Published:	2015
Subjects:	Other information and computing sciences not elsewhere classified Star graph Hamilton cycle Automorphism Symmetric group Interconnection network topology Information and Computing Sciences not elsewhere classified
Online Access:	https://hdl.handle.net/2134/16779
Tags:	Add Tag No Tags, Be the first to tag this record!