Abstract
Fault diagnosis of systems is an important area of study in the design and maintenance of multiprocessor systems. A new measure for fault diagnosis of systems, namely, h-edge tolerable diagnosability, is the maximum number of faulty nodes that a system G can guarantee to locate when the number of faulty links does not exceed h, denoted by the(G). Particularly, t0e(G) is the traditional diagnosability of G. Chang et al. (2005) [5] determined the traditional diagnosabilities of regular graphs. In this paper, we establish the h-edge tolerable diagnosabilities of regular graphs under the PMC model and the MM⁎ model, which extends their results and provides a more precise characterization for the fault diagnosis capability of regular graphs. 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.
