The 2-good-neighbor diagnosability of Cayley graphs generated by transposition trees under the PMC model and MM* model

Diagnosability is an important metric for measuring the reliability of multiprocessor systems. In 2012, Peng et al. proposed a new measure for fault diagnosis of the system, which is called g-good-neighbor diagnosability that restrains every fault-free node containing at least g fault-free neighbors. As a favorable topology structure of interconnection networks, the Cayley graph C Gamma(n) generated by the transposition tree Gamma(n) has many good properties. In this paper, we give that the 2-good-neighbor diagnosability of C Gamma(n) under the PMC model and MM* model is g(n - 2) - 1, where n >= 4 and g is the girth of C Gamma(n). (C) 2016 Elsevier B.V. All rights reserved.