On the Longest Fault-Free Paths in Hypercubes with More Faulty Nodes

Faults in a network may take various forms such as hardware/software errors, node/link faults, etc. In this paper, node-faults are addressed. Let F be a faulty set of f les 2n - 6 conditional node-faults in an injured n-cube Qn such that every node of Qn still has at least two fault - free neighbors. Then we show that Qn - F contains a path of length at least 2n - 2f - 1 (respectively, 2n - 2f - 2) between any two nodes of odd (respectively, even) distance. Since an n-cube is a bipartite graph, such kind of the fault- free path turns out to be the longest one in the case when all faulty nodes belong to the same partite set.

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

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

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

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

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

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

[7]  Shahram Latifi,et al.  Conditional Connectivity Measures for Large Multiprocessor Systems , 1994, IEEE Trans. Computers.

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

[9]  Frank Harary,et al.  Conditional connectivity , 1983, Networks.

[10]  Meijie Ma,et al.  Path embedding in faulty hypercubes , 2007, Appl. Math. Comput..

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

[12]  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.

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

[14]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .