On Optimal Embeddings in 3-Ary n -Cubes

S. Rajeshwari and M. Rajesh ()
Additional contact information
S. Rajeshwari: School of Advanced Sciences, Vellore Institute of Technology, Chennai 600127, India
M. Rajesh: School of Computer Science and Engineering, Vellore Institute of Technology, Chennai 600127, India

Mathematics, 2023, vol. 11, issue 7, 1-12

Abstract: The efficiency of a graph embedding problem when simulating one interconnection network in another interconnection network is characterized by the influential parameter of wirelength. Obtaining the minimum wirelength in an embedding problem determines the quality of that embedding. In this paper, we obtained the convex edge partition of 3-Ary n -Cubes and the minimized wirelength of the embeddings of both 3-Ary n -Cubes and circulant networks.

Keywords: circulant network; 3-Ary n -Cube; embedding; edge isoperimetric problem; dilation; wirelength (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/11/7/1711/pdf (application/pdf)
https://www.mdpi.com/2227-7390/11/7/1711/ (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:11:y:2023:i:7:p:1711-:d:1114825

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 ().