Abstract
The generalized hypercube is a highly-connective network proposed by Bhuyan and Agrawal. In this paper, we study the restricted connectivity and fault-free unicast algorithm in the generalized hypercube. Firstly, we prove that the restricted connectivity of a [Formula: see text]-dimensional generalized hypercube [Formula: see text] is [Formula: see text], where [Formula: see text] denotes the connectivity of [Formula: see text] and [Formula: see text] max [Formula: see text], under the condition that each vertex has at least one fault-free neighbor. It is almost twice the traditional connectivity of [Formula: see text]. Furthermore, we present an [Formula: see text] fault-free unicast algorithm in the generalized hypercube.
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 callMore From: International Journal of Foundations of Computer Science
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.
