Abstract
Given two disjoint vertex-sets, [Formula: see text] and [Formula: see text] in a graph, a paired many-to-many[Formula: see text]-disjoint path cover joining [Formula: see text] and [Formula: see text] is a set of pairwise vertex-disjoint paths [Formula: see text] that altogether cover every vertex of the graph, in which each path [Formula: see text] runs from [Formula: see text] to [Formula: see text]. In this paper, we reveal that a bipartite torus-like graph, if built from lower dimensional torus-like graphs that have good disjoint-path-cover properties, retain such good property. As a result, an [Formula: see text]-dimensional bipartite torus, [Formula: see text], with at most [Formula: see text] edge faults has a paired many-to-many [Formula: see text]-disjoint path cover joining arbitrary disjoint sets [Formula: see text] and [Formula: see text] of size [Formula: see text] each such that [Formula: see text] contains the equal numbers of vertices from different parts of the bipartition.
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.
