Wirelength of Enhanced Hypercube into Windmill and Necklace Graphs
Jia-Bao Liu, Micheal Arockiaraj, John Nancy Delaila
Mathematics · 2019
doi:10.3390/math7050383 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
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.
Abstract licence: CC BY
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.