13 citations · 15 across the 5 of their papers we have counts for
4 papers · 1 filter
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 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…
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…