R. Sundara Rajan

Orcid: 0000-0002-1851-6334

According to our database1, R. Sundara Rajan authored at least 42 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Reliability measures in brother trees.
Discret. Math. Algorithms Appl., April, 2024

2023
2-power domination number for Knödel graphs and its application in communication networks.
RAIRO Oper. Res., November, 2023

Minimum Linear Arrangement of Generalized Sierpinski Graphs.
J. Graph Algorithms Appl., 2023

2-domination number for special classes of hypercubes, enhanced hypercubes and Knödel graphs.
Int. J. Netw. Virtual Organisations, 2023

Maximum Subgraph Problem for 3-Regular Knödel graphs and its Wirelength.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

2022
On 2-domination number in certain octahedral networks.
Int. J. Netw. Virtual Organisations, 2022

Wiener index via wirelength of an embedding.
Discret. Math. Algorithms Appl., 2022

Embedding into Special Classes of Cyclic Graphs and its Applications in VLSI Layout.
CoRR, 2022

2021
Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes.
J. Supercomput., 2021

Deep quaternion Fourier transform for salient object detection.
J. Intell. Fuzzy Syst., 2021

An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength.
J. Graph Algorithms Appl., 2021

Edge Forcing in Butterfly Networks.
Fundam. Informaticae, 2021

Embedding complete multi-partite graphs into Cartesian product of paths and cycles.
Electron. J. Graph Theory Appl., 2021

Transmission in H-naphtalenic nanosheet.
Appl. Math. Comput., 2021

2020
Topological and Thermodynamic Entropy Measures for COVID-19 Pandemic through Graph Theory.
Symmetry, 2020

Detour Number of 1-Fault Connected Graphs.
Fundam. Informaticae, 2020

Domination parameters in hypertrees and sibling trees.
Discret. Appl. Math., 2020

Wirelength of embedding complete multipartite graphs into certain graphs.
Discret. Appl. Math., 2020

2018
A note on minimum linear arrangement for BC graphs.
Discret. Math. Algorithms Appl., 2018

2017
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., 2017

Exact wirelength of embedding chord graph into tree-based architectures.
Int. J. Netw. Virtual Organisations, 2017

A note on the locating-total domination in graphs.
Discuss. Math. Graph Theory, 2017

Exact Wirelength of Embedding Circulant Networks into Necklace and Windmill Graphs.
Ars Comb., 2017

Embedding of Hypercubes into Generalized Books.
Ars Comb., 2017

Exact Wirelength of Circulant Networks into Cycle-of-ladders.
Ars Comb., 2017

2016
Transmission in Butterfly Networks.
Comput. J., 2016

Average Distance in Interconnection Networks via Reduction Theorems for Vertex-Weighted Graphs.
Comput. J., 2016

Domination Parameters in Hypertrees.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2016

2015
A Linear Time Algorithm for Embedding Christmas Trees into Certain Trees.
Parallel Process. Lett., 2015

Embedding of Recursive Circulants into Certain Necklace Graphs.
Math. Comput. Sci., 2015

Embeddings Between Hypercubes and Hypertrees.
J. Graph Algorithms Appl., 2015

Bothway embedding of circulant network into grid.
J. Discrete Algorithms, 2015

Maximum incomplete recursive circulants in graph embeddings.
Discret. Math. Algorithms Appl., 2015

A Lower Bound for Dilation of an Embedding.
Comput. J., 2015

Minimum Linear Arrangement of Incomplete Hypercubes.
Comput. J., 2015

A Tight Bound for Congestion of an Embedding.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2015

2014
A linear time algorithm for embedding hypercube into cylinder and torus.
Theor. Comput. Sci., 2014

Embedding Circulant Networks into Butterfly and Benes Networks.
Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

2013
Embedding of Hypercubes into l-Sibling Trees.
J. Interconnect. Networks, 2013

2012
Embedding Variants of Hypercubes with Dilation 2.
J. Interconnect. Networks, 2012

Embedding of hypercubes into necklace, windmill and snake graphs.
Inf. Process. Lett., 2012

Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs.
Int. J. Comput. Math., 2012


  Loading...