OPTIMAL LAYOUT OF EMBEDDING GENERALIZED PETERSEN GRAPH $P(n,m)$ INTO CYCLE OF TRIANGLE

Graph embedding is an important tool in parallel computation and interconnection networks. Interconnection network plays a major role in parallel processing and computation system. The embedding technique helps in demonstrating parallel computer and the interconnection network is given through guest graph where the challenge is to find out non-verlapping minimum wirelength. In this paper with Petersen graph as guest graph and cycle of triangle as host graph, we find the exact wirelength of embedding Petersen graph $ P (n,m) $ into cycle of triangle.