On Optimal Embeddings in 3-Ary n-Cubes

The efficiency of a graph embedding problem when simulating one interconnection network in another interconnection network is characterized by the influential parameter of wirelength. Obtaining the minimum wirelength in an embedding problem determines the quality of that embedding. In this paper, we obtained the convex edge partition of 3-Ary n-Cubes and the minimized wirelength of the embeddings of both 3-Ary n-Cubes and circulant networks.

Automated summary

This paper discusses the efficiency of a graph embedding problem in simulating one interconnection network in another interconnection network, which is characterized by the influential parameter of wirelength. The convex edge partition of 3-Ary n-Cubes and the minimized wirelength of both 3-Ary n-Cubes and circulant networks are obtained to determine the quality of the embeddings.