Optimal Layout of Embedding onto Folded Hypercubes

Graph embedding is the major technique which is used to map guest graph into host graph. In architecture simulation, graph embedding is said to be one of the strongest application for the execution of parallel algorithms and simulation of various interconnection networks. In the recent paper [ 1 ], Berin et al. proposed a novel approach for embedding an augmented hypercube into a tree-like networks and provided the minimum wirelength of the resulting embedding, and they mentioned that this problem is open for other guest networks. In this paper, we solve one of the open problems by considering folded hypercube as the guest network. Additionally, we discuss the implementation of rooted complete binary tree in Network On Chips. Our findings contribute to the optimization of VLSI layout and provide insights into the design of efficient network structures.