default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDR. Sundara Rajan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j38]Remi Mariam Reji
, R. Sundara Rajan:
Reliability measures in brother trees. Discret. Math. Algorithms Appl. 16(3): 2350028:1-2350028:18 (2024)- [j37]A. Berin Greeni, R. Sundara Rajan, Paul Immanuel:
Embedding Augmented Cube into Certain Trees and Windmill Graphs. Int. J. Found. Comput. Sci. 35(4): 409-434 (2024) - 2023
- [j36]S. Arulanand, R. Sundara Rajan, Savari Prabhu:
2-domination number for special classes of hypercubes, enhanced hypercubes and Knödel graphs. Int. J. Netw. Virtual Organisations 29(2): 168-182 (2023) - [j35]R. Sundara Rajan, A. Berin Greeni, P. Leo Joshwa:
Minimum Linear Arrangement of Generalized Sierpinski Graphs. J. Graph Algorithms Appl. 27(9): 767-782 (2023) - [j34]R. Sundara Rajan, S. Arulanand, Savari Prabhu, Indra Rajasingh:
2-power domination number for Knödel graphs and its application in communication networks. RAIRO Oper. Res. 57(6): 3157-3168 (2023) - [c4]R. Sundara Rajan, Remi Mariam Reji, T. M. Rajalaxmi:
Maximum Subgraph Problem for 3-Regular Knödel graphs and its Wirelength. CALDAM 2023: 403-414 - 2022
- [j33]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): 2150087:1-2150087:19 (2022) - [j32]S. Arulanand, R. Sundara Rajan, Savari Prabhu:
On 2-domination number in certain octahedral networks. Int. J. Netw. Virtual Organisations 27(3): 251-266 (2022) - [i3]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 abs/2212.12312 (2022) - 2021
- [j31]Jane Olive Sharon, T. M. Rajalaxmi, Sandi Klavzar, R. Sundara Rajan, Indra Rajasingh:
Transmission in H-naphtalenic nanosheet. Appl. Math. Comput. 406: 126285 (2021) - [j30]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(2): 507-526 (2021) - [j29]G. Jessy Sujana, T. M. Rajalaxmi, Indra Rajasingh, R. Sundara Rajan:
Edge Forcing in Butterfly Networks. Fundam. Informaticae 182(3): 285-299 (2021) - [j28]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): 367-381 (2021) - [j27]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): 11331-11340 (2021) - [j26]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): 4135-4150 (2021) - 2020
- [j25]R. Sundara Rajan, T. M. Rajalaxmi, Jia-Bao Liu, G. Sethuraman:
Wirelength of embedding complete multipartite graphs into certain graphs. Discret. Appl. Math. 280: 221-236 (2020) - [j24]Indra Rajasingh, R. Jayagopal, R. Sundara Rajan:
Domination parameters in hypertrees and sibling trees. Discret. Appl. Math. 280: 237-245 (2020) - [j23]T. Venkata Raghu, R. Sundara Rajan, A. Ramesh Babu, S. Anil:
Detour Number of 1-Fault Connected Graphs. Fundam. Informaticae 172(1): 97-104 (2020) - [j22]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): 1992 (2020)
2010 – 2019
- 2018
- [j21]Xiaofang Jiang, Qinghui Liu, N. Parthiban, R. Sundara Rajan:
A note on minimum linear arrangement for BC graphs. Discret. Math. Algorithms Appl. 10(2): 1850023:1-1850023:7 (2018) - [i2]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 abs/1807.06787 (2018) - 2017
- [j20]Indra Rajasingh, R. Sundara Rajan:
Exact Wirelength of Embedding Circulant Networks into Necklace and Windmill Graphs. Ars Comb. 130: 215-237 (2017) - [j19]Micheal Arockiaraj, L. Packiaraj, R. Sundara Rajan:
Exact Wirelength of Circulant Networks into Cycle-of-ladders. Ars Comb. 132: 269-283 (2017) - [j18]R. Sundara Rajan, Indra Rajasingh, Micheal Arockiaraj, T. M. Rajalaxmi, B. Mahavir:
Embedding of Hypercubes into Generalized Books. Ars Comb. 135: 133-151 (2017) - [j17]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): 745-754 (2017) - [j16]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): 76-87 (2017) - [j15]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): 1343-1373 (2017) - [i1]Xiaofang Jiang, Qinghui Liu, Natarajan Parthiban, R. Sundara Rajan:
A note on minimum linear arrangement for BC graphs. CoRR abs/1703.01149 (2017) - 2016
- [j14]Indra Rajasingh, Paul D. Manuel, N. Parthiban, D. Azubha Jemilet, R. Sundara Rajan:
Transmission in Butterfly Networks. Comput. J. 59(8): 1174-1179 (2016) - [j13]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): 1900-1910 (2016) - [c3]R. Jayagopal, Indra Rajasingh, R. Sundara Rajan:
Domination Parameters in Hypertrees. CALDAM 2016: 299-307 - 2015
- [j12]Mirka Miller, R. Sundara Rajan, N. Parthiban, Indra Rajasingh:
Minimum Linear Arrangement of Incomplete Hypercubes. Comput. J. 58(2): 331-337 (2015) - [j11]R. Sundara Rajan, Paul D. Manuel, Indra Rajasingh, N. Parthiban, Mirka Miller:
A Lower Bound for Dilation of an Embedding. Comput. J. 58(12): 3271-3278 (2015) - [j10]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): 1550053:1-1550053:22 (2015) - [j9]Indra Rajasingh, R. Sundara Rajan, N. Parthiban, T. M. Rajalaxmi:
Bothway embedding of circulant network into grid. J. Discrete Algorithms 33: 2-9 (2015) - [j8]R. Sundara Rajan, Paul D. Manuel, Indra Rajasingh:
Embeddings Between Hypercubes and Hypertrees. J. Graph Algorithms Appl. 19(1): 361-373 (2015) - [j7]R. Sundara Rajan, N. Parthiban, T. M. Rajalaxmi:
Embedding of Recursive Circulants into Certain Necklace Graphs. Math. Comput. Sci. 9(2): 253-263 (2015) - [j6]Indra Rajasingh, R. Sundara Rajan, Paul D. Manuel:
A Linear Time Algorithm for Embedding Christmas Trees into Certain Trees. Parallel Process. Lett. 25(4): 1550008:1-1550008:17 (2015) - [c2]Paul D. Manuel, Indra Rajasingh, R. Sundara Rajan, N. Parthiban, T. M. Rajalaxmi:
A Tight Bound for Congestion of an Embedding. CALDAM 2015: 229-237 - 2014
- [j5]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: 108-115 (2014) - [c1]R. Sundara Rajan, Indra Rajasingh, Paul D. Manuel, T. M. Rajalaxmi, N. Parthiban:
Embedding Circulant Networks into Butterfly and Benes Networks. IWOCA 2014: 298-306 - 2013
- [j4]R. Sundara Rajan:
Embedding of Hypercubes into l-Sibling Trees. J. Interconnect. Networks 14(4) (2013) - 2012
- [j3]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): 1970-1978 (2012) - [j2]Indra Rajasingh, Bharati Rajan, R. Sundara Rajan:
Embedding of hypercubes into necklace, windmill and snake graphs. Inf. Process. Lett. 112(12): 509-515 (2012) - [j1]Paul D. Manuel, Indra Rajasingh, R. Sundara Rajan:
Embedding Variants of Hypercubes with Dilation 2. J. Interconnect. Networks 13(1-2) (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
