Gray Codes for Torus and Edge Disjoint Hamiltonian Cycles

Lee distance Gray codes for -ary Ò-cubes and torus networks are presented. Using these Lee distance Gray codes, it is further shown how to directly generate edge disjoint Hamiltonian cycles for a class of -ary Ò-cubes, ¾-D tori, and hypercubes.

• Type: Conference
• Year: 2000
• Where: IPPS
• Authors: Myung M. Bae, Bella Bose
• Keywords: Disjoint Hamiltonian Cycles, Distance Gray Codes, Distributed And Parallel Computing, IPPS 2000, Lee Distance