Abstract
Connectivity and diagnosability are very important parameters for the tolerant of an interconnection network. Let F be a vertex set of graph G, the g-extra connectivity k˜(g)(G) of G requires each component of G−F has at least (g+1) vertices. The g-extra conditional diagnosability t˜(g)(G) is the maximum number of faulty vertices that the graph can be guaranteed to identify under the condition that each fault-free component has at least g+1 vertices. In this paper, we study the problem about the g-extra connectivity k˜(g)(G) of the round matching composition networks, and obtain some results about the g-extra conditional diagnosability of the round matching composition networks under the PMC model and 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.
