Profiles
Research Units
Publications
Sign Up
Faculty Login
X
Journal Article
Open Access
Embedding of hypercubes into sibling trees
Arockiaraj M
,
Quadras J
,
Indra Rajasingh
,
Shalini A.J.
Published in Elsevier BV
2014
DOI:
10.1016/j.dam.2014.01.002
Volume: 169
Pages: 9 - 14
Abstract
The aim of this paper is to generalize the Congestion Lemma, which has been considered an efficient tool to compute the minimum wirelength (Manuel et al., 2009) and thereby obtain the minimum wirelength of embedding hypercubes into sibling trees. © 2013 Elsevier B.V. All rights reserved.
Download
PDF
Publisher Copy
Cite
Publisher Copy Version
Content may be subject to copyright.
This is a hybrid open access article under implied-oa license
This is a hybrid open access article under implied-oa license
PDF
Figures & Tables (5)
References (22)
Journal Details
Authors (1)
About the journal
Journal
Data powered by Typeset
Discrete Applied Mathematics
Publisher
Data powered by Typeset
Elsevier BV
ISSN
0166-218X
Open Access
Yes
Authors (1)
Indra Rajasingh
Mathematics
School of Advanced Sciences
Chennai Campus
Recent publications
Investigating substructures in goal oriented online communities: Case study of Ubuntu IRC
Induced Matching Partition of Petersen and Circulant Graphs
Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs
Metric dimension of directed graphs
Get all the updates for this publication
Follow