Article Per Year (5 Year)
p-Index From 2021 - 2026
0.23
P-Index
This Author published in this journals
All Journal Electronic Journal of Graph Theory and Applications (EJGTA)
Narayanasamy, Jothilakshmi
Hindustan Institute of Technology and Science, Chennai, India
Electrical & Electronics Engineering

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

Found 1 Documents
Search

 1 
Optimization of layout for embedding complete k-partite graphs into line graphs of certain tree architectures Narayanasamy, Jothilakshmi; Ramanathan, Sundara Rajan; Rajasingh, Indra; Ryan, Joe
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 14, No 1 (2026): 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.2026.14.1.12

Abstract

The capability of one architecture to simulate another serves as the foundation for network comparison, with embedding playing a key role in analyzing these simulations. In architectural simulation, graph embedding is one of the most powerful techniques for executing parallel algorithms and modeling diverse interconnection networks. In our earlier work, we listed an open problem that the determination of wirelength for embeddings of complete multipartite graphs into line graphs of tree-based interconnection architectures, specifically k-ary trees, banana trees, and firecracker trees. In the present paper, we explicitly construct embeddings of complete k-partite graphs into the line graphs of these three architectures and derive exact wirelength expressions. Thus, this work partially resolves the open problem posed in [1]. These results contribute toward optimized VLSI layout design and efficient Network-on-Chip (NoC) architectures.
Co-Authors Rajasingh, Indra Ramanathan, Sundara Rajan Ryan, Joe