Abstract
Restricted connectivity is a measure of fault-tolerance in multiprocessing systems. The h-restricted connectivity of a graph G, denoted by κh(G), is the minimum cardinality of vertex set F such that G−F is disconnected and the degree of each component is at least h. In this paper, we study the h-restricted connectivity of n-dimensional balanced hypercube BHn and prove that κ2h(BHn)=κ2h−1(BHn)=4h(n−h), where 1≤h≤⌊n2⌋ and n≥2.
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.
