Wirelength of Enhanced Hypercube into Windmill and Necklace Graphs

Jia-Bao Liu, Micheal Arockiaraj and John Nancy Delaila
Additional contact information
Jia-Bao Liu: School of Mathematics and Physics, Anhui Jianzhu University, Hefei 230601, China
Micheal Arockiaraj: Department of Mathematics, Loyola College, Chennai 600034, India
John Nancy Delaila: Department of Mathematics, Loyola College, Chennai 600034, India

Mathematics, 2019, vol. 7, issue 5, 1-9

Abstract: An embedding of an interconnection network into another is one of the main issues in parallel processing and computing systems. Congestion, dilation, expansion and wirelength are some of the parameters used to analyze the efficiency of an embedding in which resolving the wirelength problem reduces time and cost in the embedded design. Due to the potential topological properties of enhanced hypercube, it has become constructive in recent years, and a lot of research work has been carried out on it. In this paper, we use the edge isoperimetric problem to produce the exact wirelengths of embedding enhanced hypercube into windmill and necklace graphs.

Keywords: embedding; edge congestion; wirelength; enhanced hypercube (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/7/5/383/pdf (application/pdf)
https://www.mdpi.com/2227-7390/7/5/383/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:7:y:2019:i:5:p:383-:d:226340

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().