An Algorithm on Disjoint Paths in Enhanced Hypercubes

The enhanced hypercube is basically a hypercube with additional edges augmented, where the additional edges connect all pairs of complementary nodes in the hypercube. Taking into account the minimal routing function and the structural properties of the enhanced hypercube, \( n+1 \) internal disjoint paths from one node to other distinct \( n+1 \) nodes have been constructed in an \( n \)-dimensional enhanced hypercube. The results can be used to provide an efficient and reliable routing to avoid congestion, accelerate transmission rate, and provide alternative transmission routes in enhanced hypercube networks, thus remarkably improving the performance of the interconnect networks.