Conditional Edge-Fault Hamiltonicity of Cartesian Product Graphs

A graph G is conditional k-edge-fault Hamiltonian if it remains Hamiltonian after deleting at most k edges and each vertex incident to at least two nonfaulty edges. A graph G is k-edge-fault Hamiltonian-connected if it remains Hamiltonian-connected after deleting at most k edges. This study shows that the conditional edge-fault Hamiltonicity of the Cartesian product network G x H can be efficiently evaluated given two graphs G and H that are edge-fault Hamilton-connected and conditional edge-fault Hamiltonian. This study uses the result to evaluate the conditional edge-fault Hamiltonicity of two multiprocessor systems, the generalized hypercubes and the nearest neighbor mesh hypercubes, both of which belong to Cartesian product networks.

[1]  Abdel Elah Al-Ayyoub,et al.  The Cross Product of Interconnection Networks , 1997, IEEE Trans. Parallel Distributed Syst..

[2]  Yaagoub Ashir,et al.  Communication Algorithms in k-Ary n-Cube Interconnection Networks , 1997, Inf. Process. Lett..

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

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

[5]  Jimmy J. M. Tan,et al.  Fault hamiltonicity and fault hamiltonian connectivity of the arrangement graphs , 2004, IEEE Transactions on Computers.

[6]  Iain A. Stewart,et al.  A Multipath Analysis of Biswapped Networks , 2011, Comput. J..

[7]  Iain A. Stewart,et al.  Bipancyclicity in k-Ary n-Cubes with Faulty Edges under a Conditional Fault Assumption , 2011, IEEE Transactions on Parallel and Distributed Systems.

[8]  Bih-Sheue Shieh,et al.  On connectivity of the Cartesian product of two graphs , 1999, Appl. Math. Comput..

[9]  Saïd Bettayeb.  On the k-ary Hypercube , 1995, Theor. Comput. Sci..

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

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

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

[13]  Jimmy J. M. Tan,et al.  Hamiltonian circuit and linear array embeddings in faulty k-ary n-cubes , 2007, J. Parallel Distributed Comput..

[14]  Sun-Yuan Hsieh,et al.  Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults , 2010, J. Comb. Optim..

[15]  Hyeong-Seok Lim,et al.  Panconnectivity and Pancyclicity of Hypercube-Like Interconnection Networks with Faulty Elements , 2006, ISPA Workshops.

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

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

[18]  Sun-Yuan Hsieh,et al.  Super Fault-Tolerant Hamiltonicity of Product Networks , 2010, International Symposium on Parallel and Distributed Processing with Applications.

[19]  Iain A. Stewart,et al.  Embedding Long Paths in k-Ary n-Cubes with Faulty Nodes and Links , 2008, IEEE Transactions on Parallel and Distributed Systems.

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

[21]  Abdel Elah Al-Ayyoub,et al.  Minimal Fault Diameter for Highly Resilient Product Networks , 2000, IEEE Trans. Parallel Distributed Syst..

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

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

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

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

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

[27]  Jung-Sheng Fu.  Conditional fault Hamiltonicity of the complete graph , 2008, Inf. Process. Lett..