70
Views
0
CrossRef citations to date
0
Altmetric
Research Article

Optimal layout of recursive circulant graphs

, , &
Pages 209-219 | Received 26 Mar 2021, Accepted 23 Jul 2021, Published online: 12 Aug 2021
 

Abstract

Graph is a mathematical model represented by points and lines joining certain pairs of points. These points are addressed as vertices or nodes and the lines are addressed as edges or links. Graph embedding is a mapping of guest graph G into host graph H satisfying certain conditions. Embedding has been studied for many networks in the literature. The Recursive Circulant RC(2n,4) has several attractive topological properties. Though the embedding of parallel architectures such as Hypercubes and Mesh into Recursive Circulant has been studied, the embedding of Recursive Circulant into other architectures has not been taken up so far. In this paper, we compute the wirelength of embedding RC(2n,4),n2,n even into paths (MinLA), 1-rooted complete binary trees, regular caterpillars and ladders.

AMS CLASSIFICATION:

Disclosure statement

No potential conflict of interest was reported by the author(s).

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.