Learn More
  • Cheng-Nan Lai
  • 2012
Routing functions had been shown effective in constructing node-disjoint paths in hypercube-like networks. In this paper, by the aid of routing functions, m node-disjoint shortest paths from one source node to other m (not necessarily distinct) destination nodes are constructed in an n-dimensional hypercube, provided the existence of such node-disjoint(More)
This work investigates 2RP-property of a generalized hypercube G. Given any four distinct vertices u, v, x and y in G, let l 1 and l 2 be two integers such that l 1 (l 2) is not less than the distance between u and v (x and y), and l 1 +l 2 is equal to the number of vertices in G minus two. Then, there exist two vertex-disjoint paths P 1 and P 2 such that(More)