On the Two-Equal-Disjoint Path Cover Problem of Crossed Cubes
Pao-Lien Lai, Hong-Chun Hsu · Advances in intelligent systems research/Advances in Intelligent Systems Research · 2006
Embedding of paths have attracted much attention in the parallel processing.Many-to-many communication is one of the most central issues in various interconnection networks.A graph G is globally two-equal-disjoint path coverable if for any two distinct pairs of vertices (u, v) and (w, x) of G, there exist two disjoint paths P and Q satisfied that (1) P joins u to v and Q joins w to x, (2) |P | = |Q|, and (3) V (P ∪ Q) = V (G).In this paper, we prove that CQ n is globally 2-equal-disjoint path coverable for n ≥ 5.