Fault-tolerant cycle-embedding of crossed cubes

Information Processing Letters

Volumn 88, Issue 4, 2003, Pages 149-154

  Yang, Ming Chien ^a   Li, Tseng Kuei ^b   Tan, Jimmy J M ^a   Hsu, Lih Hsing ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^b CHING YUN UNIVERSITY   (Taiwan)

Author keywords

Crossed cube; Cycle embedding; Fault tolerance; Hamiltonian; Pancyclic

Indexed keywords

DATA PROCESSING; GRAPH THEORY; HAMILTONIANS; MATHEMATICAL MODELS;

CYCLE EMBEDDING;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 0142011456     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2003.08.007     Document Type: Article

References (6)

1. Chang C.P., Sung T.Y., Hsu L.H. Edge congestion and topological properties of crossed cubes. IEEE Trans. Parallel Distributed Systems. 11:(1):2000;64-80.
2. Efe K. The crossed cube architecture for parallel computing. IEEE Trans. Parallel Distributed Systems. 3:(5):1992;513-524.
3. Fan J. Hamilton-connectivity and cycle-embedding of the Möbius cubes. Inform. Process. Lett. 82:2002;113-117.
4. Hwang S.C., Chen G.H. Cycles in butterfly graphs. Networks. 35:(2):2000;161-171.
5. Huang W.T., Chuang Y.C., Hsu L.H., Tan J.M. On the fault-tolerant Hamiltonicity of crossed cubes. IEICE Trans. Fundamentals. E85-A:(6):2002;1359-1371.
6. Kulasinghe P., Bettayeb S. Embedding binary trees into crossed cubes. IEEE Trans. Comput. 44:(7):1995;923-929.