Abstract
A disjoint path cover of a graph is a set of pairwise vertex-disjoint paths that altogether cover every vertex of the graph. In this paper, we prove that given k sources, s1, …, sk, in an m-dimensional restricted hypercube-like graph with a set F of faults (vertices and/or edges), associated with k positive integers, l1, …, lk, whose sum is equal to the number of fault-free vertices, there exists a disjoint path cover composed of k fault-free paths, each of whose paths starts at si and contains li vertices for i∈{1,…,k}, provided |F|+k≤m−1. The bound, m−1, on |F|+k is the best possible.
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.
