Abstract
Q_n^k has been shown as an alternative to the hypercube family. For any even integer k≥4 and any integer n≥2, Q_n^k is a bipartite graph. In this paper, we will prove that given any pair of vertices, w and b, from different partite sets of Q_n^k, there exist 2n internally disjoint paths between w and b, denoted by {P_i | 0 ≤ i ≤ 2n −1}, such that U_{i=0}^{2n-1}P_i covers all vertices of Q_n^k. The result is optimal since each vertex of Q_n^k has exactly 2n neighbors.
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.
