Embedding Complete Multipartite Graphs into Certain Trees
Combinatorics
2019-11-19 v2
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 -rooted complete binary trees and -rooted sibling trees.
Cite
@article{arxiv.1910.10643,
title = {Embedding Complete Multipartite Graphs into Certain Trees},
author = {A. Arul Shantrinal and R. Sundara Rajan and A. Ramesh Babu and S. Anil and Mohammed Ali Ahmed},
journal= {arXiv preprint arXiv:1910.10643},
year = {2019}
}
Comments
Page=14, Figures=4, Journal=Accepted in the special issue of JCMCC. arXiv admin note: text overlap with arXiv:1901.07717