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.
Original language | English |
---|---|
Title of host publication | Proceedings - Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2006 |
Pages | 102-104 |
Number of pages | 3 |
DOIs | |
Publication status | Published - 2006 |
Event | 7th International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2006 - Taipei, Taiwan Duration: 2006 Dec 4 → 2006 Dec 7 |
Other
Other | 7th International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2006 |
---|---|
Country | Taiwan |
City | Taipei |
Period | 06-12-04 → 06-12-07 |
All Science Journal Classification (ASJC) codes
- Computer Networks and Communications