S.Q. Zheng, Member, /E€€, and Shahram Latifi, Senior Member, /E€€
S. Q. Zheng, Seyed Milad Mir Latifi · 1996
In this article, we consider the problem of simulating linear arrays and rings on the multiply-twisted cube. We introduce a new concept, the reflected link label sequence, and use it to define a generalized Gray Code (GGC). We show that GGCs can be easily used to identify Hamiltonian paths and cycles in the multiply-twisted cube. We also give a method for embedding a ring of arbitrary number of nodes into the multiply-twisted cube. Index Terms-Gray code, interconnection network, hypercube, multiply-twisted cube, linear array, ring, parallel computing, simulation. lNTRODUCTlON r is well known that the hypercube has many attractive