The g-good-neighbor conditional diagnosability of hypercube under PMC model

The ${\schmi g}$-Good-Neighbor Conditional Diagnosability of ${\schmi k}$-Ary ${\schmi n}$-Cubes under the PMC Modeland MM* Model

“…Motivated by these concepts of conditionally t-diagnosability and forbidden faulty sets [28], [42], Peng et al [36] then propose the g-good-neighbor conditional diagnosability by claiming that for every fault-free vertex in a system, it has at least g fault-free neighbors. Definition 2.4.4 [36].…”

“…Definition 2.4.4 [36]. A faulty set F V is called a g-goodneighbor conditional faulty set if jNðvÞ \ ðV À F Þj !…”

“…A faulty set F V is called a g-goodneighbor conditional faulty set if jNðvÞ \ ðV À F Þj ! g for every vertex v in V À F: Definiton 2.4.5 [36]. A system G ¼ ðV ðGÞ; EÞ is g-goodneighbor conditional t-diagnosable if each distinct pair of g-good-neighbor conditional faulty sets F 1 and F 2 of V with jF 1 j t; jF 2 j t are distinguishable.…”

“…Motivated by the concepts of forbidden faulty sets, Peng et al [36] then proposed the g-good-neighbor conditional diagnosability: which is defined as the maximum value t such that a graph G remains t-diagnosable under the condition that every healthy vertex v has at least g fault-free neighboring vertices. Besides, they showed that the g-goodneighbor conditional diagnosability of the n-dimensional hypercube Q n :…”

On Fault Identification in Interconnection Networks under the Comparison Model

“…( , )=1(0) implies that node judges node to be faulty (fault-free) and the outcome of test ( , ) is reliable only if node is faultfree. The PMC model has widely been adopted (see [3][4][5][6][7][8]). Another practical model is the comparison model (also called MM model), proposed by Maeng and Malek [9,10].…”