Abstract
The augmented cube [Formula: see text] is a variation of the hypercube [Formula: see text]. This paper considers the fault-tolerant Panconnectivity of [Formula: see text]. Assume that [Formula: see text] and [Formula: see text]. We prove that for any two fault-free vertices [Formula: see text] and [Formula: see text] with distance [Formula: see text] in [Formula: see text], there exists a fault-free path [Formula: see text] of each length from [Formula: see text] to [Formula: see text] in [Formula: see text] if [Formula: see text], where [Formula: see text] is the number of faulty vertices in [Formula: see text]. Moreover, the bound is sharp.
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.
