Answers are grounded in this paper and cite their sources.
The diagnosability is one of the most important measures of the reliability of networks. Consider the setting where there are large-scale failures that disconnect the network and result in many components. Then, the diagnosability is closely related to the number of components. In this paper, we define and study the g-component diagnosability of network G, which is denoted by ctg(G) and has not been addressed before. ctg(G) is the maximum number of nodes in the faulty node set F of G such that G-F has at least g components and diagnosis model can identify all nodes in F. Under PMC and MM^* diagnosis models, we show that, in the hypercube Qₙ\ (n≥ 7), ctg+1(Qₙ)=-(1/2)g²+(n-3/2)g+n when g≤ n-1. Moreover, we determine the (n+1)-component diagnosability ctₙ₊₁(Qₙ)=n²/2+n/2-2 for n≥ 7.
No takes yet. Share an insight, caveat, or question.
Zhang et al. (2020) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: