DocumentCode
2927205
Title
Cycle Embedding on Twisted Cubes
Author
Hsieh, Sun-Yuan ; Yu, Pei-Yu
Author_Institution
Dept. of Comput. Sci. & Inf. Eng., National Cheng Kung Univ., Tainan
fYear
2006
fDate
Dec. 2006
Firstpage
102
Lastpage
104
Abstract
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
Keywords
graph theory; multiprocessor interconnection networks; cycle embedding; graph; interconnection networks; twisted cubes; Computer science; Hypercubes; Multiprocessor interconnection networks; Robustness; Routing; Scalability; Interconnection networks; node-pancyclicity.; pancyclicity; twisted cubes;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Computing, Applications and Technologies, 2006. PDCAT '06. Seventh International Conference on
Conference_Location
Taipei
Print_ISBN
0-7695-2736-1
Type
conf
DOI
10.1109/PDCAT.2006.49
Filename
4032158
Link To Document