Embedding Complete Bipartite Graph into Sibling Trees with Optimum Wirelength

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 $S{T}_n^1$, and Cartesian product of 1-rooted sibling trees and paths.