Abstract
The conditional diagnosability of many well-known networks has been explored. In this paper, we analyze the conditional diagnosability of a family of networks, called the round matching composition networks, which are a class of networks composed of r (r≥4) components of the same order linked by r perfect matchings. Applying the result, we determine the conditional diagnosability of the k-ary n-cubes and the recursive circulant graphs under the PMC model and the MM model, 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 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.
