Wirelength of Embeddings in Interconnection Networks

Graph theory is an innovative field which offers innumerable ways to explore proof techniques that are involved in Discrete Mathematics. It is used as an efficient tool for designing analyzing and simulating interconnection networks. It enhances the compilation of the network like: processors memory modules or computer systems. The quality of an embedding is determined by the cost measures such as dilation congestion and wirelength. In this book we compute the exact wirelength of embedding complete bipartite graphs into certain networks.