IJPAM: Volume 86, No. 6 (2013)

EMBEDDING OF CIRCULANT NETWORKS
INTO $k$-ROOTED SIBLING TREES

R. Sundara Rajan$^1$, Indra Rajasingh$^2$, T.M. Rajalaxmi$^3$, N. Parthiban$^4$
$^{1,2}$School of Advanced Sciences
VIT University
Chennai, 600 127, INDIA
$^3$Department of Mathematics
SSN College of Engineering
Chennai, 603 110, INDIA
$^4$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 $k$-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
Year: 2013
Volume: 86
Issue: 6