Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Embedding Complete Multipartite Graphs into Certain Trees

A. Arul Shantrinal1, A. Ramesh Babu1, R. Sundara Rajan1, S. Anil2, Mohammed Ali Ahmed3
1Department of Mathematics, Hindustan Institute of Technology and Science, Chennai, India, 603 103
2Department of Computer Science and Engineering, Hindustan Institute of Technology and Science, Chennai, India, 603 103
3Department of Mathematics, College of Education for Pure Sciences, University of Baghdad, Baghdad, Iraq
  • Published: 25/02/2020

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.

Keywords: Embedding, wirelength, complete multipartite graphs, binary tree, sibling tree
Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
A. Arul Shantrinal, A. Ramesh Babu, R. Sundara Rajan, S. Anil, Mohammed Ali Ahmed. Embedding Complete Multipartite Graphs into Certain Trees[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 112. -. DOI: .