A graph is pancyclic if it contains cycles of all lengths. A graph G is node-pancyclic if for every node u, G contains cycles C of all lengths such that u is in C. The twisted cube is an alternative to the popular hypercube network. In this paper, we prove that the twisted cube is node-pancyclic.
Index Terms:
Interconnection networks, twisted cubes, pancyclicity, node-pancyclicity.
Citation:
Sun-Yuan Hsieh, Pei-Yu Yu, "Cycle Embedding on Twisted Cubes," pdcat, pp.102-104, Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT'06), 2006