Login New user?  
01-Applied Mathematics & Information Sciences
An International Journal
               
 
 
 
 
 
 
 
 
 
 
 
 
 

Content
 

Volumes > Volume 13 > No. S1

 
   

A Lower Bound for Edge-congestion of an Embedding

PP: 231-237
doi:10.18576/amis/13S124
Author(s)
R. Sundara Rajan, Indra Rajasingh, N. Parthiban, A. Arul Shantrinal, K. Jagadeesh Kumar,
Abstract
In network theory, the problem of simulating one architecture into another architecture is converted into a graph embedding problem. In this paper, we have extended our work in [1] and give algorithms to compute optimal edge-congestion of embedding hypercubes, folded hypercubes, crossed cubes and circulant networks into hypertrees thereby proving that the edge-congestion bound obtained in [1] is sharp.

  Home   About us   News   Journals   Conferences Contact us Copyright naturalspublishing.com. All Rights Reserved