Fault-Free Cycles in Conditional Faulty Folded Hypercubes

An n -dimensional folded hypercube FQ n is an attractive variance of an n -dimensional hypercube Q n , which is obtained by a standard hypercube with some extra edges established between its vertices. FQ n for any odd n is known to be bipartite. In this paper, for any FQ n (n *** 2) with at most 2n *** 3 faulty edges in which each vertex is incident with at least two fault-free edges, we prove that there exists a fault-free cycle of every even length from 4 to 2 n , and when n *** 2 is even, there also exists a fault-free cycle of every odd length from n + 1 to 2 n *** 1. The result is optimal with respect to the number of edges faults tolerated.

[1]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[2]  Jung-Sheng Fu,et al.  Conditional Fault-Tolerant Hamiltonicity of Star Graphs , 2006, 2006 Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT'06).

[3]  Lionel M. Ni,et al.  The Twisted N-Cube with Application to Multiprocessing , 1991, IEEE Trans. Computers.

[4]  Jun-Ming Xu,et al.  Edge-fault-tolerant properties of hypercubes and folded hypercubes , 2006, Australas. J Comb..

[5]  Dajin Wang.  Embedding Hamiltonian Cycles into Folded Hypercubes with Faulty Links , 2001, J. Parallel Distributed Comput..

[6]  Jun-Ming Xu,et al.  Cycles in folded hypercubes , 2006, Appl. Math. Lett..

[7]  Jung-Sheng Fu.  Longest fault-free paths in hypercubes with vertex faults , 2006, Inf. Sci..

[8]  S. Hsieh.  Some edge-fault-tolerant properties of the folded hypercube , 2008 .

[9]  Sajal K. Das,et al.  Book Review: Introduction to Parallel Algorithms and Architectures : Arrays, Trees, Hypercubes by F. T. Leighton (Morgan Kauffman Pub, 1992) , 1992, SIGA.

[10]  Xu Jun-ming,et al.  Edge-fault-tolerant hamiltonicity of folded hypercubes , 2006 .

[11]  Franco P. Preparata,et al.  The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[12]  Shahram Latifi,et al.  Properties and Performance of Folded Hypercubes , 1991, IEEE Trans. Parallel Distributed Syst..

[13]  D. West.  Introduction to Graph Theory , 1995 .

[14]  Jung-Sheng Fu,et al.  Fault-free Hamiltonian cycles in crossed cubes with conditional link faults , 2007, Inf. Sci..

[15]  Dharma P. Agrawal,et al.  Generalized Hypercube and Hyperbus Structures for a Computer Network , 1984, IEEE Transactions on Computers.

[16]  M. Lewinter,et al.  Hyper-Hamilton Laceable and Caterpillar-Spannable Product Graphs , 1997 .

[17]  Chang-Hsiung Tsai,et al.  Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes , 2007, Inf. Sci..

[18]  Junming Xu.  Topological Structure and Analysis of Interconnection Networks , 2002, Network Theory and Applications.

[19]  Jung-Sheng Fu.  Fault-free Hamiltonian cycles in twisted cubes with conditional link faults , 2008, Theor. Comput. Sci..

[20]  Jimmy J. M. Tan,et al.  Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes , 2003, Inf. Process. Lett..

[21]  Gen-Huey Chen,et al.  Hamiltonian‐laceability of star graphs , 2000 .

[22]  Sun-Yuan Hsieh,et al.  Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes , 2007, Comput. Math. Appl..

[23]  Sun-Yuan Hsieh.  A note on cycle embedding in folded hypercubes with faulty elements , 2008, Inf. Process. Lett..

[24]  Chang-Hsiung Tsai.  Linear array and ring embeddings in conditional faulty hypercubes , 2004, Theor. Comput. Sci..

[25]  M. H. Schultz,et al.  Topological properties of hypercubes , 1988, IEEE Trans. Computers.

[26]  Jimmy J. M. Tan,et al.  Highly fault-tolerant cycle embeddings of hypercubes , 2007, J. Syst. Archit..

[27]  Jung-Sheng Fu.  Fault-free cycles in folded hypercubes with more faulty elements , 2008, Inf. Process. Lett..