Sundara Rajan R

Prof. Sundara Rajan R

Department of Mathematics, Hindustan Institute of Technology and Science, Chennai 603103

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 May 2013 in The Computer Journal
Verified
Journal Article
Closed access
PDF file
MMMirka Miller
Mirka Miller
Sundara Rajan RSundara Rajan R
Sundara Rajan R
NPN. Parthiban
N. Parthiban
IRIndra Rajasingh
Indra Rajasingh
The minimum linear arrangement problem is a combinatorial optimization problem whose goal is to find a linear layout of a network in such way that a certain objective cost function is optimized. In this paper, we compute the minimum linear arrangement of incomplete hypercubes using graph embeddings.

1 June 2020 in Discrete Applied Mathematics
Verified
Journal Article
Closed access
Sundara Rajan RSundara Rajan R
Sundara Rajan R
TRT.M. Rajalaxmi
T.M. Rajalaxmi
Jia-Bao LiuJia-Bao Liu
Jia-Bao Liu
GSG. Sethuraman
G. Sethuraman

9 August 2016 in The Computer Journal
Verified
Journal Article
Closed access
PDF file
SKSandi Klavžar
Sandi Klavžar
PMPaul Manuel
Paul Manuel
JNJavad Nadjafi-Arani
Javad Nadjafi-Arani
Sundara Rajan RSundara Rajan R
Sundara Rajan R
CGCyriac Grigorious
Cyriac Grigorious
SSSudeep Stephen
Sudeep Stephen
Average distance is an important parameter for measuring the communication cost of computer networks. A popular approach for its computation is to first partition the edge set of a network into convex components using the transitive closure of the Djoković–Winkler's relation and then to compute the average distance from the respective invariants of the components. In this article, we refine this idea further by shrinking the quotient graphs into smaller weighted graph called reduced graph, so that the average distance of the original graph is obtained from the reduced graphs. We demonstrate the significance of this technique by computing the average distance of butterfly and hypertree architectures. Along the way, a computational error from Klavžar and Nadjafi-Arani ((2014) Wiener index in weighted graphs via unification of Θ*-classes, Eur. J. Combin. 36, 71–76) is corrected.

2 November 2014 in Journal of Mathematical Chemistry
Verified
Journal Article
Closed access
PDF file
JQJasintha Quadras
Jasintha Quadras
AMA. Sajiya Merlin Mahizl
A. Sajiya Merlin Mahizl
IRIndra Rajasingh
Indra Rajasingh
Sundara Rajan RSundara Rajan R
Sundara Rajan R

22 June 2012 in International Journal of Computer Mathematics
Verified
Journal Article
Closed access
IRIndra Rajasingh
Indra Rajasingh
BRBharati Rajan
Bharati Rajan
Sundara Rajan RSundara Rajan R
Sundara Rajan R
Hypercubes are a very popular model for parallel computation because of their regularity and the relatively small number of interprocessor connections. In this paper, we present an algorithm for embedding special class of circulant networks into their optimal hypercubes with dilation 2 and prove its correctness. Also, we embed special class of circulant networks into special class of generalized Petersen graphs with dilation 2 and vice versa.

12 January 2016 in The Computer Journal
Verified
Journal Article
Closed access
PDF file
IRIndra Rajasingh
Indra Rajasingh
PMPaul Manuel
Paul Manuel
NPN. Parthiban
N. Parthiban
DJD. Azubha Jemilet
D. Azubha Jemilet
Sundara Rajan RSundara Rajan R
Sundara Rajan R
Wiener index of a graph | $G$ | is defined as | $W(G) = \frac {1}{2} \sum _{{u,v \in V(G)}} d_{{G}}(u,v)$ | . The Transmission index | $T(u)$ | of a vertex | $u$ | in a graph | $G$ | is defined as | $T(u) = \sum _{{v \in V}}d(u,v)$ | . The original technique for the computation of Wiener index was by brute-force method applying distance matrix. Later a new technique using convex partition was introduced and this convex partition method was shown to be more efficient than distance matrix method. However, this convex partition method is not universal. Some interesting architectures such as butterfly and mesh of trees do not induce convex partition. In this paper, we introduce another partition technique to accommodate larger classes of graphs which are not solved by convex partition method. This partition technique is called transmission partition method. It is different from distance matrix method and convex partition method. We show that this new technique significantly reduces the time complexity to compute the Wiener index to constant time for larger classes of graphs. We demonstrate the efficiency of this technique on butterfly networks by computing its Wiener index and its Transmission index in constant time.