Abstract
This paper considers the problem of many-to-many disjoint paths in the hypercube Qn with fv faulty vertices and fe faulty edges, and obtains the following result. For any integer k with 1⩽k⩽n-1, any two sets S and T of k fault-free vertices in different parts, if fv+fe⩽n-k-1, then there exist k disjoint fault-free (S,T)-paths in Qn which contains at least 2n-2fv vertices. This result is optimal in the worst case.
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.
