IJPAM: Volume 86, No. 6 (2013)
INTO -ROOTED SIBLING TREES
School of Advanced Sciences
Chennai, 600 127, INDIA
Department of Mathematics
SSN College of Engineering
Chennai, 603 110, INDIA
School of Computing Sciences and Engineering
VIT University, Chennai, 600 127, INDIA
Abstract. Graph embedding problems have gained importance in the field of interconnection networks for parallel computer architectures. In this paper, we determine the exact wirelength and dilation of embedding circulant networks into -rooted sibling trees.
Received: May 9, 2013
AMS Subject Classification: 05C78, 05C85
Key Words and Phrases: embedding, dilation, wirelength, circulant network, sibling tree
Download paper from here.
DOI: 10.12732/ijpam.v86i6.13 How to cite this paper?
Source: International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395