On Embedding Hamiltonian Cycles in Crossed Cubes
Document Type
Article
Publication Date
3-1-2008
Abstract
We study the embedding of Hamiltonian cycle in the Crossed Cube, a prominent variant of the classical hypercube, which is obtained by crossing some straight links of a hypercube, and has been attracting much research interest in literatures since its proposal. We will show that due to the loss of link-topology regularity, generating Hamiltonian cycles in a crossed cube is a more complicated procedure than in its original counterpart. The paper studies how the crossed links affect an otherwise succinct process to generate a host of well-structured Hamiltonian cycles traversing all nodes. The condition for generating these Hamiltonian cycles in a crossed cube is proposed. An algorithm is presented that works out a Hamiltonian cycle for a given link permutation. The useful properties revealed and algorithm proposed in this paper can find their way when system designers evaluate a candidate network' s competence and suitability, balancing regularity and other performance criteria, in choosing an interconnection network.
DOI
10.1109/TPDS.2007.70729
Montclair State University Digital Commons Citation
Wang, Dajin, "On Embedding Hamiltonian Cycles in Crossed Cubes" (2008). Department of Computer Science Faculty Scholarship and Creative Works. 437.
https://digitalcommons.montclair.edu/compusci-facpubs/437