Embedding Complete Multipartite Graphs into Certain Trees

Abstract

One of the important features of an interconnection network is its ability to efficiently simulate programs or parallel algorithms written for other architectures. Such a simulation problem can be mathematically formulated as a graph embedding problem. In this paper, we embed complete multipartite graphs into certain trees, such as $k$-rooted complete binary trees and $k$-rooted sibling trees.

Page=14, Figures=4, Journal=Accepted in the special issue of JCMCC. arXiv admin note: text overlap with arXiv:1901.07717