Relationship between diagnosability and non-inclusive diagnosability of triangle-free connected graphs under the PMC model

Diagnosability, defined as the maximum number of fault processors that the system can recognize, is an important parameter in the design and maintenance of multiprocessor systems. To improve diagnosability, Ding et al. [5] proposed the non-inclusive diagnosabil-ity. In this paper, we discuss the relationship between the diagnosability and non-inclusive diagnosability of triangle-free connected graphs under the PMC model. We use the non -inclusive diagnosability of some regular graphs as examples in our discussion.(c) 2022 Elsevier B.V. All rights reserved.