Abstract
ABSTRACTIn a simple graph , let be the minimum cardinality of the neighbourhoods of any two adjacent vertices, i.e. . Let be the connectivity of G. In this paper, we prove that the pessimistic diagnosability of G, denoted by , is equal to if the following two conditions hold: (1) for any subset with , ; (2) . As examples of its applications, we prove that the pessimistic diagnosabilities of n-dimensional hypercube-like network , dual-cube , pancake network , and burnt pancake graph are (), (), () and (), respectively.
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 callMore From: International Journal of Computer Mathematics: Computer Systems Theory
Disclaimer: 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.
