Embed longest rings onto star graphs with vertex faults

The star graph has been recognized as an attractive alternative to the hypercube. Let F/sub e/ and F/sub /spl nu// be the sets of vertex faults and edge faults, respectively. Previously, Tseng et al. showed that an n-dimensional star graph can embed a ring of length n! if |F/sub e/|/spl les/n-3 (|F/sub /spl nu//|=0), and a ring of length at least n!-4|F/sub /spl nu//| if |F/sub /spl nu//|/spl les/n-3 (|F/sub e/|=0). Since an n-dimensional star graph is regular of degree n-1 and is bipartite with two partite sets of equal size, our result achieves optimality in the worst case.

[1]  Frank Harary,et al.  Distance in graphs , 1990 .

[2]  Jehoshua Bruck,et al.  Fault-Tolerant de Bruijn and Shuffle-Exchange Networks , 1994, IEEE Trans. Parallel Distributed Syst..

[3]  Sanjay Ranka,et al.  Embedding meshes on the star graph , 1990, Supercomputing '90.

[4]  Francis Y. L. Chin,et al.  Optimal Simulation of Full Binary Trees on Faulty Hypercubes , 1995, IEEE Trans. Parallel Distributed Syst..

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

[6]  Jehoshua Bruck,et al.  Fault-Tolerant Meshes and Hypercubes with Minimal Numbers of Spares , 1993, IEEE Trans. Computers.

[7]  Sheldon B. Akers,et al.  The Star Graph: An Attractive Alternative to the n-Cube , 1994, ICPP.

[8]  Selim G. Akl,et al.  A Parallel Algorithm for Computing Fourier Transforms on the Star Graph , 1994, IEEE Trans. Parallel Distributed Syst..

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

[10]  Zevi Miller,et al.  Near Embeddings of Hypercubes into Cayley Graphs on the Symmetric Group , 1994, IEEE Trans. Computers.

[11]  Afonso Ferreira,et al.  Optimal information dissemination in Star and Pancake networks , 1993, Proceedings of 1993 5th IEEE Symposium on Parallel and Distributed Processing.

[12]  Khaled Day,et al.  A Comparative Study of Topological Properties of Hypercubes and Star Graphs , 1994, IEEE Trans. Parallel Distributed Syst..

[13]  Jang-Ping Sheu,et al.  An Optimal Broadcasting Algorithm without Message Redundancy in Star Graphs , 1995, IEEE Trans. Parallel Distributed Syst..

[14]  Selim G. Akl,et al.  Optimal Communication algorithms on Star Graphs Using Spanning Tree Constructions , 1995, J. Parallel Distributed Comput..

[15]  Arun K. Somani,et al.  An Efficient Sorting Algorithm for the Star Graph Interconnection Network , 1990, ICPP.

[16]  Jehoshua Bruck,et al.  On the Construction of Fault-Tolerant Cube-Connected Cycles Networks , 1991, J. Parallel Distributed Comput..

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

[18]  Wei-Tek Tsai,et al.  Fault-Tolerant Multicasting on Hypercubes , 1994, J. Parallel Distributed Comput..

[19]  Dilip K. Saikia,et al.  Two Ranking Schemes for Efficient Computation on the Star Interconnection Network , 1996, IEEE Trans. Parallel Distributed Syst..

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

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

[22]  Shahram Latifi,et al.  Conditional Fault Diameter of Star Graph Networks , 1996, J. Parallel Distributed Comput..

[23]  Nader Bagherzadeh,et al.  Embedding an Arbitrary Binary Tree into the Star Graph , 1996, IEEE Trans. Computers.

[24]  Jehoshua Bruck,et al.  Wildcard dimensions, coding theory and fault-tolerant meshes and hypercubes , 1993, FTCS-23 The Twenty-Third International Symposium on Fault-Tolerant Computing.

[25]  Jie Wu.  Reliable Unicasting in Faulty Hypercubes Using Safety Levels , 1997, IEEE Trans. Computers.

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

[27]  Ivan Stojmenovic,et al.  Data communication and computational geometry on the star and pancake interconnection networks , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.

[28]  Selim G. Akl,et al.  Load balancing and selection on the star and pancake interconnection networks , 1993, [1993] Proceedings of the Twenty-sixth Hawaii International Conference on System Sciences.

[29]  S. Louis Hakimi,et al.  Fault-Tolerant Routing in DeBruijn Comrnunication Networks , 1985, IEEE Transactions on Computers.

[30]  Jie Wu.  Safety Levels-An Efficient Mechanism for Achieving Reliable Broadcasting in Hypercubes , 1995, IEEE Trans. Computers.

[31]  John P. Hayes,et al.  Optimally edge fault-tolerant trees , 1996 .

[32]  Selim G. Akl,et al.  On Some Properties and Algorithms for the Star and Pancake Interconnection Networks , 1994, J. Parallel Distributed Comput..

[33]  Krzysztof Diks,et al.  Efficient Gossiping by Packets in Networks with Random Faults , 1996, SIAM J. Discret. Math..

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