Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs. - Indra Rajasingh; Bharati Rajan; R. Sundara Rajan (Int. J. Comput. Math., 2012)

Embedding of hypercubes into necklace, windmill and snake graphs. - Indra Rajasingh; Bharati Rajan; R. Sundara Rajan (Inf. Process. Lett., 2012)

Embedding Variants of Hypercubes with Dilation 2. - Paul D. Manuel; Indra Rajasingh; R. Sundara Rajan (J. Interconnect. Networks, 2012)

Embedding of Hypercubes into l-Sibling Trees. - R. Sundara Rajan (J. Interconnect. Networks, 2013)

Embedding Circulant Networks into Butterfly and Benes Networks. - R. Sundara Rajan; Indra Rajasingh; Paul D. Manuel; T. M. Rajalaxmi; N. Parthiban (IWOCA, 2014)

A linear time algorithm for embedding hypercube into cylinder and torus. - R. Sundara Rajan; Indra Rajasingh; N. Parthiban; T. M. Rajalaxmi (Theor. Comput. Sci., 2014)

A Tight Bound for Congestion of an Embedding. - Paul D. Manuel; Indra Rajasingh; R. Sundara Rajan; N. Parthiban; T. M. Rajalaxmi (CALDAM, 2015)

Minimum Linear Arrangement of Incomplete Hypercubes. - Mirka Miller; R. Sundara Rajan; N. Parthiban; Indra Rajasingh (Comput. J., 2015)

A Lower Bound for Dilation of an Embedding. - R. Sundara Rajan; Paul D. Manuel; Indra Rajasingh; N. Parthiban; Mirka Miller (Comput. J., 2015)

Maximum incomplete recursive circulants in graph embeddings. - R. Sundara Rajan; Indra Rajasingh; Paul D. Manuel; Mirka Miller; T. M. Rajalaxmi (Discret. Math. Algorithms Appl., 2015)

Bothway embedding of circulant network into grid. - Indra Rajasingh; R. Sundara Rajan; N. Parthiban; T. M. Rajalaxmi (J. Discrete Algorithms, 2015)

Embeddings Between Hypercubes and Hypertrees. - R. Sundara Rajan; Paul D. Manuel; Indra Rajasingh (J. Graph Algorithms Appl., 2015)

Embedding of Recursive Circulants into Certain Necklace Graphs. - R. Sundara Rajan; N. Parthiban; T. M. Rajalaxmi (Math. Comput. Sci., 2015)

A Linear Time Algorithm for Embedding Christmas Trees into Certain Trees. - Indra Rajasingh; R. Sundara Rajan; Paul D. Manuel (Parallel Process. Lett., 2015)

Domination Parameters in Hypertrees. - R. Jayagopal; Indra Rajasingh; R. Sundara Rajan (CALDAM, 2016)

Average Distance in Interconnection Networks via Reduction Theorems for Vertex-Weighted Graphs. - Sandi Klavzar; Paul D. Manuel; Mohammad J. Nadjafi-Arani; R. Sundara Rajan; Cyriac Grigorious; Sudeep Stephen (Comput. J., 2016)

Transmission in Butterfly Networks. - Indra Rajasingh; Paul D. Manuel; N. Parthiban; D. Azubha Jemilet; R. Sundara Rajan (Comput. J., 2016)

Exact Wirelength of Circulant Networks into Cycle-of-ladders. - Micheal Arockiaraj; L. Packiaraj; R. Sundara Rajan (Ars Comb., 2017)

Embedding of Hypercubes into Generalized Books. - R. Sundara Rajan; Indra Rajasingh; Micheal Arockiaraj; T. M. Rajalaxmi; B. Mahavir (Ars Comb., 2017)

Exact Wirelength of Embedding Circulant Networks into Necklace and Windmill Graphs. - Indra Rajasingh; R. Sundara Rajan (Ars Comb., 2017)

A note on the locating-total domination in graphs. - R. Sundara Rajan; R. Jayagopal; Paul D. Manuel; Mirka Miller; Indra Rajasingh (Discuss. Math. Graph Theory, 2017)

Exact wirelength of embedding chord graph into tree-based architectures. - N. Parthiban; Joe Ryan 001; Indra Rajasingh; R. Sundara Rajan; L. Nirmala Rani (Int. J. Netw. Virtual Organisations, 2017)

Comprehensive solution procedure for optimizing replenishment policies of instantaneous deteriorating items with stock-dependent demand under partial trade credit linked to order quantity. - R. Sundara Rajan; R. Uthayakumar 001 (Int. J. Syst. Assur. Eng. Manag., 2017)

A note on minimum linear arrangement for BC graphs. - Xiaofang Jiang; Qinghui Liu; N. Parthiban; R. Sundara Rajan (Discret. Math. Algorithms Appl., 2018)

Wirelength of embedding complete multipartite graphs into certain graphs. - R. Sundara Rajan; T. M. Rajalaxmi; Jia-Bao Liu; G. Sethuraman 001 (Discret. Appl. Math., 2020)

Domination parameters in hypertrees and sibling trees. - Indra Rajasingh; R. Jayagopal; R. Sundara Rajan (Discret. Appl. Math., 2020)

Detour Number of 1-Fault Connected Graphs. - T. Venkata Raghu; R. Sundara Rajan; A. Ramesh Babu; S. Anil (Fundam. Informaticae, 2020)

Topological and Thermodynamic Entropy Measures for COVID-19 Pandemic through Graph Theory. - G. Kirithiga Nandini; R. Sundara Rajan; A. Arul Shantrinal; T. M. Rajalaxmi; Indra Rajasingh; Krishnan Balasubramanian (Symmetry, 2020)

Transmission in H-naphtalenic nanosheet. - Jane Olive Sharon; T. M. Rajalaxmi; Sandi Klavzar; R. Sundara Rajan; Indra Rajasingh (Appl. Math. Comput., 2021)

Embedding complete multi-partite graphs into Cartesian product of paths and cycles. - R. Sundara Rajan; A. Arul Shantrinal; T. M. Rajalaxmi; Jianxi Fan; Weibei Fan (Electron. J. Graph Theory Appl., 2021)

Edge Forcing in Butterfly Networks. - G. Jessy Sujana; T. M. Rajalaxmi; Indra Rajasingh; R. Sundara Rajan (Fundam. Informaticae, 2021)

An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength. - A. Arul Shantrinal; Sandi Klavzar; T. M. Rajalaxmi; R. Sundara Rajan (J. Graph Algorithms Appl., 2021)

Deep quaternion Fourier transform for salient object detection. - T. Revathi; T. M. Rajalaxmi; R. Sundara Rajan; Wilhelm Passarella Freire (J. Intell. Fuzzy Syst., 2021)

Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes. - R. Sundara Rajan; Thomas Kalinowski; Sandi Klavzar; Hamid Mokhtar; T. M. Rajalaxmi (J. Supercomput., 2021)

Embedding into Special Classes of Cyclic Graphs and its Applications in VLSI Layout. - R. Sundara Rajan; Rini Dominic D.; T. M. Rajalaxmi; L. Packiaraj (CoRR, 2022)

Wiener index via wirelength of an embedding. - G. Kirithiga Nandini; R. Sundara Rajan; T. M. Rajalaxmi; A. Arul Shantrinal; Sharifah Kartini Said Husain; Roslan Hasni (Discret. Math. Algorithms Appl., 2022)

On 2-domination number in certain octahedral networks. - S. Arulanand; R. Sundara Rajan; Savari Prabhu (Int. J. Netw. Virtual Organisations, 2022)

Maximum Subgraph Problem for 3-Regular Knödel graphs and its Wirelength. - R. Sundara Rajan; Remi Mariam Reji; T. M. Rajalaxmi (CALDAM, 2023)

2-domination number for special classes of hypercubes, enhanced hypercubes and Knödel graphs. - S. Arulanand; R. Sundara Rajan; Savari Prabhu (Int. J. Netw. Virtual Organisations, 2023)

Minimum Linear Arrangement of Generalized Sierpinski Graphs. - R. Sundara Rajan; A. Berin Greeni; P. Leo Joshwa (J. Graph Algorithms Appl., 2023)

2-power domination number for Knödel graphs and its application in communication networks. - R. Sundara Rajan; S. Arulanand; Savari Prabhu; Indra Rajasingh (RAIRO Oper. Res., 2023)

Wide and fault diameter in Kneser graphs for enhanced fault tolerance in parallel computing. - R. Sundara Rajan; G. Kirithiga Nandini; Yuqing Lin; Remi Mariam Reji (Int. J. Netw. Virtual Organisations, 2024)

Embedding of Hypercube into Fractal Cubic Network. - R. Sundara Rajan; Remi Mariam Reji; N. Sadagopan; Ismail Naci Cangül (Parallel Process. Lett., 2024)

Reliability measures in brother trees. - Remi Mariam Reji; R. Sundara Rajan (Discret. Math. Algorithms Appl., 2024)

Embedding Augmented Cube into Certain Trees and Windmill Graphs. - A. Berin Greeni; R. Sundara Rajan; Paul Immanuel (Int. J. Found. Comput. Sci., 2024)

Embedding Knödel Graph into Cube-like Architectures: Dilation Optimization and Wirelength Analysis. - Remi Mariam Reji; R. Sundara Rajan; T. M. Rajalaxmi (J. Interconnect. Networks, 2024)

Optimal Layout of (Kp - Cp)n into Wheel-Like Networks. - R. Sundara Rajan; Rini Dominic D.; N. Sadagopan (J. Interconnect. Networks, 2025)