Network embedding on Planar Octahedron networks

An important feature of an interconnection network is its ability to efficiently simulate programs written for other architectures. Such a simulation problem can be mathematically formulated as graph embedding. Graph embedding is an important technique for studying computational capabilities of processor interconnection networks and task distributions, which is a recent focus of research in the parallel processing area. This paper, deal with embedding of hexagonal networks, honeycomb networks, Silicate networks, Oxide networks, and certain Nanosheet in to Planar Octahedron networks.