Optimal bounds for disjoint Hamilton cycles in star graphs

In interconnection network topologies, the n-dimensional star graph Stn has n! vertices corresponding to permutations a (1) : : : a (n) of n symbols a1; : : : ; an and edges which exchange the positions of the rst symbol a (1) with any one of the other symbols. The star graph compares favorably with...

Full description

Bibliographic Details

Main Authors:	Parisa Derakhshan, Walter Hussak
Format:	Default Article
Published:	2017
Subjects:	Other information and computing sciences not elsewhere classified Star graphs Hamilton cycles Automorphis Information and Computing Sciences not elsewhere classified
Online Access:	https://hdl.handle.net/2134/25577
Tags:	Add Tag No Tags, Be the first to tag this record!