Embedding of hypercubes into necklace, windmill and snake graphs

Graph embedding problems have gained importance in the field of interconnection networks for parallel computer architectures. In this paper, we determine the exact wirelength of embedding hypercubes into necklace, windmill and snake graphs.

► Embedding and Exact wirelength problems are NP-complete.
► We compute the exact wirelength of hypercube into certain graphs.
► We found the maximum subgraph for hypercubes.
► We define certain host graphs and it is a superior network for research.