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

Processor fault diagnosis plays an important role in multiprocessor systems for reliable computing, and the diagnosability of many well-known networks has been explored. For example, hypercubes, crossed cubes, möbius cubes, and twisted cubes of dimension n all have diagnosability n. The conditional diagnosability of n-dimensional hypercube Qn is proved to be 4(n − 2) + 1 under the PMC model. In this paper, we study the g-good-neighbor conditional diagnosability of Qn under the PMC model and show that it is 2g(n − g) + 2g − 1 for 0 ⩽ g ⩽ n − 3. The g-good-neighbor conditional diagnosability of Qn is several times larger than the classical diagnosability.