On deriving conditional diagnosability of interconnection networks

We provide general techniques to estimate an upper bound of the conditional diagnosability of a graph G, and to prove that such a bound is also tight when a certain connectivity result is available for G  . As an example, we derive the exact value of the conditional diagnosability for the (n,k)(n,k)-star graph.

► General techniques to estimate an upper bound of the conditional diagnosability of a graph G, are provided. ► We show that such a bound is also tight when a certain connectivity result is available for G  . ► As an example, we derive the exact value of the conditional diagnosability for the (n,k)(n,k)-star graph.