1-vertex-fault-tolerant Cycles Embedding on Folded Hypercubes

In this paper, we focus on a hypercube-like structure, the folded hypercube, which is basically a standard hypercube with some extra links between its nodes. Let f be a faulty vertex in an n-dimensional folded hypercube FQ"n. We show that FQ"n-{f} contains a fault-free cycle of every even length from 4 to 2^n-2 if n>=3 and, furthermore, every odd length from n+1 to 2^n-1 if n>=2 and n is even.

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

[2]  D. S. SzyId,et al.  Parallel Computation: Models And Methods , 1998, IEEE Concurrency.

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

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

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

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

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

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

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

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

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

[12]  Gen-Huey Chen,et al.  Hamiltonian-laceability of star graphs , 1997, Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (I-SPAN'97).

[13]  Sudhakar Yalamanchili,et al.  Interconnection Networks , 2011, Encyclopedia of Parallel Computing.

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

[15]  Kathryn Fraughnaugh,et al.  Introduction to graph theory , 1973, Mathematical Gazette.

[16]  Norbert Ascheuer,et al.  Hamiltonian path problems in the on-line optimization of flexible manufacturing systems , 1996 .

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

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

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

[20]  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).

[21]  Peter L. Hammer,et al.  Discrete Applied Mathematics , 1993 .