EMBEDDING VARIANTS OF HYPERCUBES WITH DILATION 2
Paul D Manuel, Indra Rajasingh, R. Sundara Rajan · Journal of Interconnection Networks · 2012
Graph embedding has been known as a powerful tool for implementation of parallel algorithms and simulation of interconnection networks. In this paper, we introduce a technique to obtain a lower bound for the dilation of an embedding. Moreover, we give algorithms for embedding variants of hypercubes with dilation 2 proving that the lower bound obtained is sharp. Further, we compute the exact wirelength of embedding folded hypercubes and augmented cubes into hypercubes.