Abstract
The conditional diagnosability is an important measure of reliability of interconnection networks. Much progress has been made in the past decade. By consolidating various results, a general scheme can be developed to solve the conditional diagnosability problem for many important classes of interconnection networks; thus eliminating various ad-hoc methods used in earlier studies. The buttery network is an important interconnection network and it has been rediscovered multiple times by different authors. The hyper-buttery network is a graph that amalgamates the buttery network and the hypercube. In this paper, we solve the conditional diagnosability problem for these hyper-buttery networks and their generalizations.
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.
