Star graph automorphisms and disjoint Hamilton cycles

The search for edge-disjoint Hamilton cycles in star graphs is important for the design of interconnection network topologies. We define automorphisms for star graphs St n of degree n−1, for every positive odd integer n, which yield permutations of labels for the edges of St n taken from the set of...

Full description

Bibliographic Details

Main Authors:	Parisa Derakhshan, Walter Hussak
Format:	Default Article
Published:	2013
Subjects:	Theory of computation not elsewhere classified Other information and computing sciences not elsewhere classified Star graph Symmetric group Interconnection network topologies Computation Theory and Mathematics Information and Computing Sciences not elsewhere classified
Online Access:	https://hdl.handle.net/2134/14791
Tags:	Add Tag No Tags, Be the first to tag this record!