Hybrid fault diagnosis capability analysis of triangle-free graphs

Abstract

Fault diagnosis capability is an important metric of the reliability of multiprocessor systems. The h-edge tolerable diagnosability is the maximum number of faulty nodes that the system can guarantee to locate when the number of faulty links does not exceed h. In fact, the 0-edge tolerable diagnosability is exactly the traditional diagnosability. In this paper, we determine the h-edge tolerable diagnosabilities of triangle-free graphs under the PMC model and the MM⁎ model, respectively, which extend the results of triangle-free regular graphs (Wei and Xu (2019) [26]). As applications, the h-edge tolerable diagnosabilities of many networks are determined under the PMC model and the MM⁎ model.