T.M. Rajalaxmi
Department of Mathematics, Sri Sivasubramaniya Nadar College of Engineering, Chennai, 603 110.

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

Embedding complete multi-partite graphs into Cartesian product of paths and cycles R. Sundara Rajan; A. Arul Shantrinal; T.M. Rajalaxmi; Jianxi Fan; Weibei Fan
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 9, No 2 (2021): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2021.9.2.21

Abstract

Graph embedding is a powerful method in parallel computing that maps a guest network GĀ into a host network H. The performance of an embedding can be evaluated by certain parameters, such as the dilation, the edge congestion, and the wirelength. In this manuscript, we obtain the wirelength (exact and minimum) of embedding complete multi-partite graphs into Cartesian product of paths and/or cycles, which include n-cube, n-dimensional mesh (grid), n-dimensional cylinder, and n-dimensional torus, etc., as the subfamilies.