R. Sundara Rajan

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 38

Top Topics

Graph Embedding

Cartesian Product

Interconnection Networks

Top Venues

Discret. Math. Algorithms Appl.

Publications

Remi Mariam Reji, R. Sundara Rajan
Reliability measures in brother trees. Discret. Math. Algorithms Appl. 16 (3) (2024)
S. Arulanand, R. Sundara Rajan, S. Prabhu
2-domination number for special classes of hypercubes, enhanced hypercubes and Knödel graphs. Int. J. Netw. Virtual Organisations 29 (2) (2023)
R. Sundara Rajan, A. Berin Greeni, P. Leo Joshwa
Minimum Linear Arrangement of Generalized Sierpinski Graphs. J. Graph Algorithms Appl. 27 (9) (2023)
R. Sundara Rajan, S. Arulanand, S. Prabhu, Indra Rajasingh
2-power domination number for Knödel graphs and its application in communication networks. RAIRO Oper. Res. 57 (6) (2023)
R. Sundara Rajan, Remi Mariam Reji, T. M. Rajalaxmi
Maximum Subgraph Problem for 3-Regular Knödel graphs and its Wirelength. CALDAM (2023)
G. Kirithiga Nandini, R. Sundara Rajan, T. M. Rajalaxmi, A. Arul Shantrinal, Sharifah Kartini Said Husain, Roslan Hasni
Wiener index via wirelength of an embedding. Discret. Math. Algorithms Appl. 14 (1) (2022)
S. Arulanand, R. Sundara Rajan, S. Prabhu
On 2-domination number in certain octahedral networks. Int. J. Netw. Virtual Organisations 27 (3) (2022)
R. Sundara Rajan, Rini Dominic D., T. M. Rajalaxmi, L. Packiaraj
Embedding into Special Classes of Cyclic Graphs and its Applications in VLSI Layout. CoRR (2022)
T. Revathi, T. M. Rajalaxmi, R. Sundara Rajan, Wilhelm Passarella Freire
Deep quaternion Fourier transform for salient object detection. J. Intell. Fuzzy Syst. 40 (6) (2021)
Jane Olive Sharon, T. M. Rajalaxmi, Sandi Klavzar, R. Sundara Rajan, Indra Rajasingh
Transmission in H-naphtalenic nanosheet. Appl. Math. Comput. 406 (2021)
R. Sundara Rajan, A. Arul Shantrinal, T. M. Rajalaxmi, Jianxi Fan, Weibei Fan
Embedding complete multi-partite graphs into Cartesian product of paths and cycles. Electron. J. Graph Theory Appl. 9 (1) (2021)
R. Sundara Rajan, Thomas Kalinowski, Sandi Klavzar, Hamid Mokhtar, T. M. Rajalaxmi
Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes. J. Supercomput. 77 (4) (2021)
G. Jessy Sujana, T. M. Rajalaxmi, Indra Rajasingh, R. Sundara Rajan
Edge Forcing in Butterfly Networks. Fundam. Informaticae 182 (3) (2021)
A. Arul Shantrinal, Sandi Klavzar, T. M. Rajalaxmi, R. Sundara Rajan
An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength. J. Graph Algorithms Appl. 25 (1) (2021)
G. Kirithiga Nandini, R. Sundara Rajan, A. Arul Shantrinal, T. M. Rajalaxmi, Indra Rajasingh, Krishnan Balasubramanian
Topological and Thermodynamic Entropy Measures for COVID-19 Pandemic through Graph Theory. Symmetry 12 (12) (2020)
R. Sundara Rajan, T. M. Rajalaxmi, Jia-Bao Liu, G. Sethuraman
Wirelength of embedding complete multipartite graphs into certain graphs. Discret. Appl. Math. 280 (2020)
T. Venkata Raghu, R. Sundara Rajan, A. Ramesh Babu, S. Anil
Detour Number of 1-Fault Connected Graphs. Fundam. Informaticae 172 (1) (2020)
Indra Rajasingh, R. Jayagopal, R. Sundara Rajan
Domination parameters in hypertrees and sibling trees. Discret. Appl. Math. 280 (2020)
Xiaofang Jiang, Qinghui Liu, N. Parthiban, R. Sundara Rajan
A note on minimum linear arrangement for BC graphs. Discret. Math. Algorithms Appl. 10 (2) (2018)
R. Sundara Rajan, Thomas Kalinowski, Sandi Klavzar, Hamid Mokhtar, T. M. Rajalaxmi
Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes. CoRR (2018)
R. Sundara Rajan, R. Jayagopal, Paul D. Manuel, Mirka Miller, Indra Rajasingh
A note on the locating-total domination in graphs. Discuss. Math. Graph Theory 37 (3) (2017)
Xiaofang Jiang, Qinghui Liu, Natarajan Parthiban, R. Sundara Rajan
A note on minimum linear arrangement for BC graphs. CoRR (2017)
Indra Rajasingh, R. Sundara Rajan
Exact Wirelength of Embedding Circulant Networks into Necklace and Windmill Graphs. Ars Comb. 130 (2017)
R. Sundara Rajan, R. Uthayakumar
Comprehensive solution procedure for optimizing replenishment policies of instantaneous deteriorating items with stock-dependent demand under partial trade credit linked to order quantity. Int. J. Syst. Assur. Eng. Manag. 8 (2s) (2017)
R. Sundara Rajan, Indra Rajasingh, Micheal Arockiaraj, T. M. Rajalaxmi, B. Mahavir
Embedding of Hypercubes into Generalized Books. Ars Comb. 135 (2017)
Micheal Arockiaraj, L. Packiaraj, R. Sundara Rajan
Exact Wirelength of Circulant Networks into Cycle-of-ladders. Ars Comb. 132 (2017)
N. Parthiban, Joe Ryan, Indra Rajasingh, R. Sundara Rajan, L. Nirmala Rani
Exact wirelength of embedding chord graph into tree-based architectures. Int. J. Netw. Virtual Organisations 17 (1) (2017)
Sandi Klavzar, Paul D. Manuel, Mohammad J. Nadjafi-Arani, R. Sundara Rajan, Cyriac Grigorious, Sudeep Stephen
Average Distance in Interconnection Networks via Reduction Theorems for Vertex-Weighted Graphs. Comput. J. 59 (12) (2016)
R. Jayagopal, Indra Rajasingh, R. Sundara Rajan
Domination Parameters in Hypertrees. CALDAM (2016)
Indra Rajasingh, Paul D. Manuel, N. Parthiban, D. Azubha Jemilet, R. Sundara Rajan
Transmission in Butterfly Networks. Comput. J. 59 (8) (2016)
R. Sundara Rajan, N. Parthiban, T. M. Rajalaxmi
Embedding of Recursive Circulants into Certain Necklace Graphs. Math. Comput. Sci. 9 (2) (2015)
Paul D. Manuel, Indra Rajasingh, R. Sundara Rajan, N. Parthiban, T. M. Rajalaxmi
A Tight Bound for Congestion of an Embedding. CALDAM (2015)
Indra Rajasingh, R. Sundara Rajan, N. Parthiban, T. M. Rajalaxmi
Bothway embedding of circulant network into grid. J. Discrete Algorithms 33 (2015)
Mirka Miller, R. Sundara Rajan, N. Parthiban, Indra Rajasingh
Minimum Linear Arrangement of Incomplete Hypercubes. Comput. J. 58 (2) (2015)
Indra Rajasingh, R. Sundara Rajan, Paul D. Manuel
A Linear Time Algorithm for Embedding Christmas Trees into Certain Trees. Parallel Process. Lett. 25 (4) (2015)
R. Sundara Rajan, Paul D. Manuel, Indra Rajasingh
Embeddings Between Hypercubes and Hypertrees. J. Graph Algorithms Appl. 19 (1) (2015)
R. Sundara Rajan, Indra Rajasingh, Paul D. Manuel, Mirka Miller, T. M. Rajalaxmi
Maximum incomplete recursive circulants in graph embeddings. Discret. Math. Algorithms Appl. 7 (4) (2015)
R. Sundara Rajan, Paul D. Manuel, Indra Rajasingh, N. Parthiban, Mirka Miller
A Lower Bound for Dilation of an Embedding. Comput. J. 58 (12) (2015)
R. Sundara Rajan, Indra Rajasingh, Paul D. Manuel, T. M. Rajalaxmi, N. Parthiban
Embedding Circulant Networks into Butterfly and Benes Networks. IWOCA (2014)
R. Sundara Rajan, Indra Rajasingh, N. Parthiban, T. M. Rajalaxmi
A linear time algorithm for embedding hypercube into cylinder and torus. Theor. Comput. Sci. 542 (2014)
R. Sundara Rajan
Embedding of Hypercubes into l-Sibling Trees. J. Interconnect. Networks 14 (4) (2013)
Indra Rajasingh, Bharati Rajan, R. Sundara Rajan
Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs. Int. J. Comput. Math. 89 (15) (2012)
Indra Rajasingh, Bharati Rajan, R. Sundara Rajan
Embedding of hypercubes into necklace, windmill and snake graphs. Inf. Process. Lett. 112 (12) (2012)
Paul D. Manuel, Indra Rajasingh, R. Sundara Rajan
Embedding Variants of Hypercubes with Dilation 2. J. Interconnect. Networks 13 (1-2) (2012)