The cyclic diagnosability of star grraphs *
Listed in
This article is not in any list yet, why not save it to one of your lists.Abstract
Connectivity and diagnosability are two important parameters for the tolerance of an interconnection network. The cyclic diagnosability ct(G) is the maximum number of faulty vertices that the graph can be guaranted to identify under the condition that the remaining graph has at least two components contain a cycle. In this paper, we study the problem about the cyclic diagnosability ct(G) of star graphs and obtain probability analysis of its cyclic diagnosability.
