Vellore Institute of Technology (VIT) is a private university located in&nbsp;Tamil Nadu, India. Founded in 1984, as Vellore Engineering College, the institution offers 20 undergraduate, 34 postgraduate, four integrated and four research programs. It has campuses in Vellore, Amravati, Bhopal and Chennai.

VIT is one of the top ranked private universities in India according to NIRF, THE and QS Rankings.&nbsp;Govt. of India has recognized&nbsp;VIT, Vellore as an&nbsp;Institution of Eminence. This has allowed VIT to take independent quality initiatives and move up in world ranking.

&nbsp;

&nbsp;

VIT University

In this paper, we determine the wirelength of embedding complete bipartite graphs K2n-1, 2n-1into 1-rooted sibling tree ST1nand Cartesian product of 1-rooted sibling trees and paths. © 2020 Kansai University. All rights reserved.

Mathematics

School of Advanced Sciences

Chennai Campus

Journal of Combinatorial Mathematics and Combinatorial Computing

Embedding complete bipartite graph into sibling trees with optimum wirelength

Graph embedding is an important technique used in studying the problem of efficiently implementing parallel algorithms on parallel computers. Wirelength is an embedding parameter widely studied in data structures and data representations, electrical networks, VLSI network and chemical graphs. This parameter had been studied for embedding complete bipartite graphs into complete necklace, star necklace and windmill graphs. © 2020 The Authors. Published by Elsevier B.V.

Fulltext

Procedia Computer Science

Embedding complete bipartite graphs into necklace graphs

Interconnection networks provide an effective mechanism for exchanging data between processors in a parallel computing system. Graph embedding problems have gained importance in the field of interconnection networks. In this paper, we determine the congestion and wirelength of embedding complete bipartite graphs K2mn,2mn into grids M[2m × 2n], m ≤ n and cylinders P2m × C2n, m ≤ n. Copyright © 2017 Inderscience Enterprises Ltd.

International Journal of Networking and Virtual Organisations

Embedding complete bipartite graph into grid with optimum congestion and wirelength

Graph embedding problems have gained importance in the field of interconnection networks for parallel computer architectures. In this paper, we determine the congestion of embedding complete bi-partite graphs into multicyclic graphs. © Research India Publications.