Conditional diagnosability of matching composition networks under the MM* model
Information Sciences: an International Journal
Hi-index | 14.98 |
(t,k)-Diagnosis, which is a generalization of sequential diagnosis, requires that at least k faulty processors be identified and replaced in each iteration provided there are at most t faulty processors, where t \ge k. Let \kappa (G) and n(G) be, respectively, the node connectivity and the number of nodes in a graph G. In this paper, we compute the (t,k)-diagnosability for a class of component-composition graphs under the comparison diagnosis model. We show that the m-dimensional component-composition graph G (m \ge 4) is (\Omega (h),\kappa (G))-diagnosable, whereh= \left\{\matrix{\displaystyle{2^{m-2}\times (m-3)\times \lg {(m-1)}\over (m-1)^2} & {\rm if} 2^{m-1} \le n(G)