Abstract
The class of k-ary n-cubes represents the most commonly used interconnection topology for parallel and distributed computing systems. Embedding of disjoint paths has attracted much attention in the parallel processing. In disjoint path problems, the many-to-many disjoint path problem is the most generalized one. This paper considers the problem of many-to-many disjoint path covers in the k-ary n-cube Qnk with even k≥4, and obtains the following result. Let m be an integer with 1≤m≤2n−1. For any two sets S and T of m vertices in different partite sets, Qnk has m disjoint (S,T)-paths containing all vertices of Qnk and our result is optimal.
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.
