Hamiltonian laceability on edge fault star graph

The star graph is an attractive alternative to the hypercube graph. It possess many nice topological properties. Edge fault tolerance is an important issue for a network since the edges in the network may fail sometimes. In this paper, we show that the n-dimensional star graph is (n-3)-edge fault tolerant hamiltonian laceable, (n-3)-edge fault tolerant strongly Hamiltonian laceable, and (n-4)-edge fault tolerant hyper Hamiltonian laceable. All these results are optimal in a sense described in this paper.

[1]  Dilip Sarkar,et al.  Optimal Broadcasting on the Star Graph , 1992, IEEE Trans. Parallel Distributed Syst..

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

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

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

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

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

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

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

[9]  Stephen A. Wong.  Hamilton cycles and paths in butterfly graphs , 1995, Networks.

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

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

[12]  Frank Thomson Leighton.  Introduction to parallel algorithms and architectures: arrays , 1992 .

[13]  S. Lakshmivarahan,et al.  Embedding of cycles and grids in star graphs , 1990, Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990.

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