13 citations · 17 across the 7 of their papers we have counts for
8 papers
Embedding into Special Classes of Cyclic Graphs and its Applications in VLSI Layout
R. Sundara Rajan, Rini Dominic D., T. M. Rajalaxmi +1
Graph embedding is the major technique which is used to map guest graph into host graph. In architecture simulation, graph embedding is said to be one of the strongest application…
Edge Forcing in Butterfly Networks
Jessy Sujana G., T. M. Rajalaxmi, Indra Rajasingh +1
A zero forcing set is a set of vertices of a graph , called forced vertices of , which are able to force the entire graph by applying the following process iteratively: A…
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…
Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes
R. Sundara Rajan, Thomas Kalinowski, Sandi Klavžar +2
Interconnection networks provide an effective mechanism for exchanging data between processors in a parallel computing system. One of the most efficient interconnection networks is…
A note on minimum linear arrangement for BC graphs
Xiaofang Jiang, Qinghui Liu, Natarajan Parthiban +1
A linear arrangement is a labeling or a numbering or a linear ordering of the vertices of a graph. In this paper we solve the minimum linear arrangement problem for bijective conne…