Fault-Tolerant Bipancyclicity of Faulty Hypercubes Under the Generalized Conditional-Fault Model

Let F_v be a set of faulty nodes in an n-dimensional hypercube, denoted by Q_n. Also, let F_e be a set of faulty edges in which at least one end-node of each edge is faulty. An edge in Q_n is said to be critical if it is either fault-free or in F_e. In this paper, we prove that, for up to 2n-4 faulty nodes and/or edges, an n-dimensional hypercube contains a fault-free cycle of every even length from 4 to 2^n-2oF_vo in which each node is incident to at least two critical edges. Our result improves on the previously best known results reported in the literature.

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

[2]  Jung-Sheng Fu,et al.  Hamiltonicity of the Hierarchical Cubic Network , 2001, Theory of Computing Systems.

[3]  Shahram Latifi,et al.  Optimal ring embedding in hypercubes with faulty links , 1992, [1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing.

[4]  Jun-Ming Xu,et al.  Edge-fault-tolerant edge-bipancyclicity of hypercubes , 2005, Inf. Process. Lett..

[5]  Jun-Ming Xu,et al.  Edge-pancyclicity and Hamiltonian laceability of the balanced hypercubes , 2007, Appl. Math. Comput..

[6]  Xiaohua Jia,et al.  Optimal path embedding in crossed cubes , 2005, IEEE Transactions on Parallel and Distributed Systems.

[7]  Chun-Hua Chen,et al.  Pancyclicity on Möbius cubes with maximal edge faults , 2004, Parallel Comput..

[8]  Jehoshua Bruck,et al.  Embedding Cube-Connected Cycles Graphs into Faulty Hypercubes , 1994, IEEE Trans. Computers.

[9]  Arunabha Sen,et al.  On some topological properties of hypercube, incomplete hypercube and supercube , 1993, [1993] Proceedings Seventh International Parallel Processing Symposium.

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

[11]  Selim G. Akl.  Parallel computation: models and methods , 1997 .

[12]  Sun-Yuan Hsieh,et al.  Conditional Edge-Fault Hamiltonicity of Matching Composition Networks , 2009, IEEE Transactions on Parallel and Distributed Systems.

[13]  Ray-Shang Lo,et al.  Embedding longest fault-free paths in arrangement graphs with faulty vertices , 2001, Networks.

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

[15]  Jun-Ming Xu,et al.  Panconnectivity of locally twisted cubes , 2006, Appl. Math. Lett..

[16]  Yukio Shibata,et al.  Pancyclicity of recursive circulant graphs , 2002, Inf. Process. Lett..

[17]  Abhijit Sengupta.  On Ring Embedding in Hypercubes with Faulty Nodes and Links , 1998, Inf. Process. Lett..

[18]  Jung-Sheng Fu.  Fault-tolerant cycle embedding in the hypercube , 2003, Parallel Comput..

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

[20]  Jean-Claude Bermond,et al.  Decomposition into Cycles I: Hamilton Decompositions , 1990 .

[21]  Mee Yee Chan,et al.  On the Existence of Hamiltonian Circuits in Faulty Hypercubes , 1991, SIAM J. Discret. Math..

[22]  Yi-Ping Hung,et al.  Multicast communication in wormhole-routed 2D torus networks with hamiltonian cycle model , 2009, J. Syst. Archit..

[23]  Mee Yee Chan,et al.  Fault-Tolerant Embedding of Complete Binary Trees in Hypercubes , 1993, IEEE Trans. Parallel Distributed Syst..

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

[25]  Jun-Ming Xu,et al.  Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes , 2007, Parallel Comput..

[26]  Sun-Yuan Hsieh,et al.  Pancyclicity of Restricted Hypercube-Like Networks under the Conditional Fault Model , 2010, SIAM J. Discret. Math..

[27]  Yaagoub Ashir,et al.  Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes , 2002, SIAM J. Discret. Math..

[28]  Junming Xu,et al.  Survey on path and cycle embedding in some networks , 2009 .

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

[30]  Cauligi S. Raghavendra,et al.  Embedding of Rings and Meshes onto Faulty Hypercubes Using Free Dimensions , 1994, IEEE Trans. Computers.

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

[32]  Sun-Yuan Hsieh,et al.  Edge-bipancyclicity of a hypercube with faulty vertices and edges , 2008, Discret. Appl. Math..

[33]  Jou-Ming Chang,et al.  Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs , 2004, Networks.

[34]  Chih-Ping Chu,et al.  Multicast communication in wormhole-routed symmetric networks with hamiltonian cycle model , 2005, J. Syst. Archit..

[35]  Bella Bose,et al.  Fault-Tolerant Ring Embedding in de Bruijn Networks , 1993, IEEE Trans. Computers.

[36]  Chang-Hsiung Tsai.  Fault-tolerant cycles embedded in hypercubes with mixed link and node failures , 2008, Appl. Math. Lett..

[37]  Gen-Huey Chen,et al.  Embedding Hamiltonian paths in faulty arrangement graphs with the backtracking method , 2001, SIGCPR '01.

[38]  Yu-Chee Tseng.  Embedding a Ring in a Hypercube with Both Faulty Links and Faulty Nodes , 1996, Inf. Process. Lett..

[39]  Yu-Chee Tseng,et al.  Fault-tolerant ring embedding in star graphs , 1996, Proceedings of International Conference on Parallel Processing.

[40]  Gen-Huey Chen,et al.  Fault-Free Hamiltonian Cycles in Faulty Arrangement Graphs , 1999, IEEE Trans. Parallel Distributed Syst..

[41]  Hyeong-Seok Lim,et al.  Many-to-many disjoint path covers in hypercube-like interconnection networks with faulty elements , 2006, IEEE Transactions on Parallel and Distributed Systems.

[42]  Jimmy J. M. Tan,et al.  Fault-tolerant hamiltonian laceability of hypercubes , 2002, Inf. Process. Lett..

[43]  Sun-Yuan Hsieh,et al.  Extended Fault-Tolerant Cycle Embedding in Faulty Hypercubes , 2009, IEEE Transactions on Reliability.

[44]  Tzung-Shi Chen,et al.  A dual-hamiltonian-path-based multicasting strategy for wormhole-routed star graph interconnection networks , 2002, J. Parallel Distributed Comput..

[45]  Ming-Syan Chen,et al.  Processor Allocation in an N-Cube Multiprocessor Using Gray Codes , 1987, IEEE Transactions on Computers.

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

[47]  Mee Yee Chan,et al.  Distributed Fault-Tolerant Embeddings of Rings in Hypercubes , 1990, J. Parallel Distributed Comput..

[48]  Jun-Ming Xu,et al.  Edge-pancyclicity of Möbius cubes , 2005, Inf. Process. Lett..

[49]  Sun-Yuan Hsieh,et al.  Optimal fault-tolerant Hamiltonicity of star graphs with conditional edge faults , 2008, The Journal of Supercomputing.

[50]  Jun-Ming Xu,et al.  Fault-tolerant pancyclicity of augmented cubes , 2007, Inf. Process. Lett..

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

[52]  Sun-Yuan Hsieh.  Fault-tolerant cycle embedding in the hypercube with more both faulty vertices and faulty edges , 2006, Parallel Comput..

[53]  Sun-Yuan Hsieh,et al.  Hamiltonian path embedding and pancyclicity on the Mobius cube with faulty nodes and faulty edges , 2006, IEEE Transactions on Computers.

[54]  Jung-Heum Park,et al.  Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements , 2007, Theor. Comput. Sci..