TY - GEN
T1 - Cycle embedding on twisted cubes
AU - Hsieh, Sun Yuan
AU - Yu, Pei Yu
PY - 2006
Y1 - 2006
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=38949188937&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=38949188937&partnerID=8YFLogxK
U2 - 10.1109/PDCAT.2006.49
DO - 10.1109/PDCAT.2006.49
M3 - Conference contribution
AN - SCOPUS:38949188937
SN - 0769527361
SN - 9780769527369
T3 - Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings
SP - 102
EP - 104
BT - Proceedings - Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2006
T2 - 7th International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2006
Y2 - 4 December 2006 through 7 December 2006
ER -