Embedding Wheel-like Networks

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Sundara Rajan r.; Rajalaxmi T.M.; Stephen Sudeep; Arul Shantrinal A.; Jagadeesh Kumar k.

Educational Videos and Scientific Workshops

Scientific Information Database

ISSN: 2588-4824

Journal Paper

Paper Information

Journal: Iranian Journal of Mathematical Sciences and Informatics Year:2023 | Volume:18 | Issue:2 Page(s): 185-198

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

Embedding Wheel-like Networks

Author(s)

Keywords

EmbeddingQ4

WheelQ4

Friendship graphQ4

MedianQ4

HamiltonianQ4

Abstract

One of the important features of an interconnection network is its ability to efficiently simulate programs or parallel algorithms written for other architectures. Such a simulation problem can be mathematically formulated as a graph Embedding problem. In this paper we compute the lower bound for dilation and congestion of Embedding onto Wheel-like networks. Further, we compute the exact dilation of Embedding Wheellike networks into hypertrees, proving that the lower bound obtained is sharp. Again, we compute the exact congestion of Embedding windmill graphs into circulant graphs, proving that the lower bound obtained is sharp. Further, we compute the exact wirelength of Embedding Wheels and fans into 1, 2-fault Hamiltonian graphs. Using this we estimate the exact wirelength of Embedding Wheels and fans into circulant graphs, generalized Petersen graphs, augmented cubes, crossed cubes, Möbius cubes, twisted cubes, twisted n-cubes, locally twisted cubes, generalized twisted cubes, odd-dimensional cube connected cycle, hierarchical cubic networks, alternating group graphs, arrangement graphs, 3-regular planer Hamiltonian graphs, star graphs, generalised matching networks, fully connected cubic networks, tori and 1-fault traceable graphs.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops

Download

Move to top

وبگردی