Abstract
Fault diagnosis is important for the reliability of interconnection networks. This paper addresses the fault diagnosis of n-dimensional pancake graph Pn under the comparison diagnosis model. By the concept of local diagnosability, we first prove that the diagnosabitly of Pn is n − 1, and it has strong local diagnosability property even if there are n − 3 faulty edges. Furthermore, we present efficient algorithms to locate extended star and Hamiltonian path structures in Pn, respectively. According to the works of Li et al. and Lai, the extended star and Hamiltonian path structures can be used to identify all faulty vertices in linear time, provided the number of faulty vertices is no more than n − 1.
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.
