Embedding Circulant and Grid Based Network

Graph embedding problems have gained importance in the field of interconnection networks for parallel computer architectures. In this paper, we prove that grid and cylinder are the subgraphs of certain circulant networks. Further, we present an algorithm to embed tori into certain circulant networks with dilation\(2\) and vice-versa.