13 citations · 17 across the 7 of their papers we have counts for
4 papers · 1 filter
Embedding Complete Multipartite Graphs into Certain Trees
A. Arul Shantrinal, R. Sundara Rajan, A. Ramesh Babu +2
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 simulatio…
Embedding onto Wheel-like Networks
R. Sundara Rajan, T. M. Rajalaxmi, Sudeep Stephen +2
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 simulatio…
Domination Parameters in Hypertrees and Sibling trees
Indra Rajasingh, R. Jayagopal, R. Sundara Rajan
A locating-dominating set (LDS) of a graph is a dominating set of such that for every two vertices and in , . The…
Embedding complete multi-partite graphs into Cartesian product of paths and cycles
R. Sundara Rajan, A. Arul Shantrinal, K. Jagadeesh Kumar +3
Graph embedding is a powerful method in parallel computing that maps a guest network into a host network . The performance of an embedding can be evaluated by certain parame…