Cycle embedding on twisted cubes

Sun-Yuan Hsieh, Pei Yu Yu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

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 languageEnglish
Title of host publicationProceedings - Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2006
Pages102-104
Number of pages3
DOIs
Publication statusPublished - 2006
Event7th International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2006 - Taipei, Taiwan
Duration: 2006 Dec 42006 Dec 7

Other

Other7th International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2006
CountryTaiwan
CityTaipei
Period06-12-0406-12-07

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Cycle embedding on twisted cubes'. Together they form a unique fingerprint.

Cite this