Highly fault-tolerant cycle embeddings of hypercubes

Journal of Systems Architecture

Volumn 53, Issue 4, 2007, Pages 227-232

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

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^b PROVIDENCE UNIVERSITY   (Taiwan)

Author keywords

Bipancyclic; Conditional; Cycle embedding; Fault tolerance; Hypercube

Indexed keywords

COMPUTER NETWORKS; EMBEDDED SYSTEMS; HAMILTONIANS; OPTIMIZATION; TELECOMMUNICATION LINKS;

BIPANCYCLIC; CONDITIONAL FAULT BIPANCYCLIC; CYCLE EMBEDDING; HYPERCUBE;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 33846909068     PISSN: 13837621     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.sysarc.2006.10.008     Document Type: Article

References (18)

1. Araki T., and Shibata Y. Pancyclicity of recursive circulant graphs. Inform. Process. Lett. 81 4 (2002) 187-190
2. Chan M.Y., and Lee S.-J. On the existence of Hamiltonian circuits in faulty hypercubes. SIAM J. Discrete Math. 4 (1991) 511-527
3. Chen G.H., Fu J.S., and Fang J.F. Hypercomplete: a pancyclic recursive topology for large-scale distributed multicomputer systems. Networks 35 1 (2000) 56-69
4. Day K., and Tripathi A. Embedding of cycles in arrangement graphs. IEEE Trans. Comput. 42 8 (1993) 1002-1006
5. Fan J. Hamilton-connectivity and cycle-embedding of the Möbius cubes. Inform. Process. Lett. 82 (2002) 113-117
6. Germa A., Heydemann M.C., and Sotteau D. Cycles in the cube-connected cycles graph. Discrete Appl. Math. 83 (1998) 135-155
7. Hsieh S.Y., and Chen C.H. Pancyclicity on Möbius cubes with maximal edge faults. Parallel Comput. 30 (2004) 407-421
8. Hsu H.C., Li T.K., Tan J.M., and Hsu L.H. Fault Hamiltonicity and fault Hamiltonian connectivity of the arrangement graphs. IEEE Trans. Comput. 53 1 (2004) 39-53
9. Huang C.H., Hsiao J.Y., and Lee R.C.T. An optimal embedding of cycles into incomplete hypercubes. Inf. Process. Lett. 72 (1999) 213-218
10. Kanevsky A., and Feng C. On the embedding of cycles in pancake graphs. Parallel Comput. 21 (1995) 923-936
11. Latifi S., Hegde M., and Naraghi-Pour M. Conditional connectivity measures for large multiprocessor systems. IEEE Trans. Comput. 43 2 (1994) 218-222
12. Li T.K., Tsai C.H., Tan J.J.M., and Hsu L.H. Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes. Inf. Process. Lett. 87 (2003) 107-110
13. Rouskov Y., Latifi S., and Srimani P.K. Conditional fault diameter of star graph networks. J. Parallel Distrib. Comput. 33 (1996) 91-97
14. Saad Y., and Shultz M.H. Topological properties of hypercubes. IEEE Trans. Comput. 37 7 (1998) 867-872
15. Tel G. Topics in distributed algorithms. Cambridge International Series on Parallel Computation vol. 1 (1991), Cambridge University Press
16. Tsai C.H., Tan J.J.M., Liang T., and Hsu L.H. Fault-tolerant hamiltonian laceability of hypercubes. Inf. Process. Lett. 83 (2002) 301-306
17. Tseng Y.C., Chang S.H., and Sheu J.P. Fault-Tolerant Ring Embedding in a Star Graph with Both Link and Node Failures. IEEE Trans. Parallel Distrib. Syst. 8 12 (1997) 1185-1195
18. Yang M.C., Li T.K., Tan J.J.M., and Hsu L.H. Fault-tolerant cycle-embedding of crossed cubes. Inf. Process. Lett. 88 4 (2003) 149-154