Rajeshwari S ; M Rajesh - Exact Wirelength of Embedding 3-Ary n-Cubes into certain Cylinders and Trees

fi:9392 - Fundamenta Informaticae, May 30, 2023, Volume 188, Issue 4
Exact Wirelength of Embedding 3-Ary n-Cubes into certain Cylinders and Trees

Authors: Rajeshwari S ; M Rajesh

    Graph embeddings play a significant role in the design and analysis of parallel algorithms. It is a mapping of the topological structure of a guest graph G into a host graph H, which is represented as a one-to-one mapping from the vertex set of the guest graph to the vertex set of the host graph. In multiprocessing systems the interconnection networks enhance the efficient communication between the components in the system. Obtaining minimum wirelength in embedding problems is significant in the designing of network and simulating one architecture by another. In this paper, we determine the wirelength of embedding 3-ary n-cubes into cylinders and certain trees.


    Volume: Volume 188, Issue 4
    Published on: May 30, 2023
    Accepted on: April 4, 2023
    Submitted on: April 27, 2022
    Keywords: Computer Science - Discrete Mathematics,68R01, 68R10

    Consultation statistics

    This page has been seen 138 times.
    This article's PDF has been downloaded 97 times.