Abstract

Fault tolerance is especially important for interconnection networks, since the growing size of the networks increases its vulnerability to component failures. A classic measure for the fault tolerance of a network in the case of vertex failures is its connectivity. Given a network based on a graph G and a positive integer h, the -connectivity of G is the minimum cardinality of a set of vertices in G, if any, whose deletion disconnects G, and the minimum degree of every connected component is at least h. This study investigates the -connectivity of the dual-cubes for h = 1 and h = 2, respectively. Furthermore, the study establishes the conditional diagnosability of under the Preparata Metze Chien (PMC) model.

Full Text
Paper version not known

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 call

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.