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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
