IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i7p1711-d1114825.html
   My bibliography  Save this article

On Optimal Embeddings in 3-Ary n -Cubes

Author

Listed:
  • 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)

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.

Suggested Citation

  • S. Rajeshwari & M. Rajesh, 2023. "On Optimal Embeddings in 3-Ary n -Cubes," Mathematics, MDPI, vol. 11(7), pages 1-12, April.
    • Handle: RePEc:gam:jmathe:v:11:y:2023:i:7:p:1711-:d:1114825
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/7/1711/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/11/7/1711/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Indra Rajasingh & Paul Manuel & M. Arockiaraj & Bharati Rajan, 2013. "Embeddings of circulant networks," Journal of Combinatorial Optimization, Springer, vol. 26(1), pages 135-151, July.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Micheal Arockiaraj & Jessie Abraham & Arul Jeya Shalini, 2019. "Node set optimization problem for complete Josephus cubes," Journal of Combinatorial Optimization, Springer, vol. 38(4), pages 1180-1195, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:11:y:2023:i:7:p:1711-:d:1114825. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.