Local diagnosability of generic star-pyramid graph

The problem of fault diagnosis in network has been discussed widely. In this paper, we study the local diagnosability of a generic star-pyramid graph. We prove that under the PMC model the local diagnosability of each vertex in a generic star-pyramid graph is equal to its degree and the generic star-pyramid has the strong local diagnosability property. Then we study the local diagnosability of a faulty graph. After showing some properties of the graph, we prove that a generic star-pyramid graph keeps the strong property no matter how many edges are faulty under the condition that each vertex is incident with at least four fault-free edges.

[1]  Jimmy J. M. Tan,et al.  Conditional diagnosability measures for large multiprocessor systems , 2005, IEEE Transactions on Computers.

[2]  Jimmy J. M. Tan,et al.  A Local Diagnosability Measure for Multiprocessor Systems , 2007, IEEE Transactions on Parallel and Distributed Systems.

[3]  GERNOT METZE,et al.  On the Connection Assignment Problem of Diagnosable Systems , 1967, IEEE Trans. Electron. Comput..

[4]  Hamid Sarbazi-Azad,et al.  The Star-Pyramid Graph: An Attractive Alternative to the Pyramid , 2005, Asia-Pacific Computer Systems Architecture Conference.

[5]  Shuming Zhou,et al.  Diagnosability of the Incomplete Star Graphs , 2007 .

[6]  Arun K. Somani,et al.  On Diagnosability of Large Fault Sets in Regular Topology-Based Computer Systems , 1996, IEEE Trans. Computers.