Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Embedding Complete Bipartite Graph into Sibling Trees with Optimum Wirelength

A. Berin Greeni1
1School of Advanced Sciences, Vellore Institute of Technology, Chennai, India
  • Published: 25/02/2020

Abstract

In this paper, we determine the wirelength of embedding complete bipartite graphs \(K_{2^{n-1}, 2^{n-1}} into 1-rooted sibling tree \(ST_n^1\), and Cartesian product of 1-rooted sibling trees and paths.

Keywords: Embedding, congestion, edge isoperimetric problem, complete bipartite graph, tree.
Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
A. Berin Greeni. Embedding Complete Bipartite Graph into Sibling Trees with Optimum Wirelength[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 112. -. DOI: .