• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.6
• /
• pp.1361-1368
• /
• 2014

In this paper, we analyze emddings among HFCube(n,n), HCN(n,n), HFN(n,n) with lower network cost than that of Hypercube. The results are as follows. We propose that $Q_{2n}$ can be embedded into HFCube(n,n) with dilation 5, congestion 2. HCN(n,n) and HFN(n,n) are subgraphs of HFCube(n,n). HFCube(n,n) can be embedded into HFN(n,n) with dilation 3. HFCube(n,n) can be embedded into HCN(n,n) with dilation O(n). The results will be helpful to analyze several efficient properties in each interconnection network.