Embedding longest fault-free paths in arrangement graphs with faulty vertices

The arrangement graph is a generalization of the star graph. Recent work by Hsieh et al. showed that an arrangement graph with faulty vertices contains a longest fault-free cycle. In this paper, we generalize Hsieh et al.'s result by constructing a longest fault-free path between two arbitrary distinct healthy vertices. Moreover, our result can tolerate more faulty vertices than can Hsieh et al.'s result. The situation of simultaneous faulty vertices and faulty edges is also discussed.

[1]  Bella Bose,et al.  Distributed Ring Embedding in Faulty De Bruijn Networks , 1997, IEEE Trans. Computers.

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

[3]  Shahram Latifi,et al.  On Embedding Rings into a Star-Related Network , 1997, Inf. Sci..

[4]  Sartaj Sahni,et al.  Embedding Hamiltonians and Hypercubes in Star Interconnection Graphs , 1990, ICPP.

[5]  Khaled Day,et al.  Embedding Grids, Hypercubes, and Trees in Arrangement Graphs , 1993, 1993 International Conference on Parallel Processing - ICPP'93.

[6]  Sheldon B. Akers,et al.  A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.

[7]  Khaled Day,et al.  Embedding of Cycles in Arrangement Graphs , 1993, IEEE Trans. Computers.

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

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

[10]  Shahram Latifi,et al.  Hamiltonicity of the Clustered-Star Graph with Embedding Applications , 1996, PDPTA.

[11]  Gen-Huey Chen,et al.  Embed longest rings onto star graphs with vertex faults , 1998, Proceedings. 1998 International Conference on Parallel Processing (Cat. No.98EX205).

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

[13]  S. Lakshmivarahan,et al.  Embedding of cycles and Grids in Star Graphs , 1991, J. Circuits Syst. Comput..

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

[15]  Arkady Kanevsky,et al.  Embedding rings in recursive networks , 1994, Proceedings of 1994 6th IEEE Symposium on Parallel and Distributed Processing.

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

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

[18]  Yu-Chee Tseng,et al.  Fault-Tolerant Ring Embedding in a Star Graph with Both Link and Node Failures , 1997, IEEE Trans. Parallel Distributed Syst..

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

[20]  Khaled Day,et al.  Arrangement Graphs: A Class of Generalized Star Graphs , 1992, Inf. Process. Lett..