Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIndra Rajasingh
- > Home > Persons > Indra Rajasingh
Publications
- 2021
[j51]R. Stalin Mary, N. Parthiban, Indra Rajasingh, Paul D. Manuel
:
Optimal layout of recursive circulant graphs. Int. J. Comput. Math. Comput. Syst. Theory 6(3): 209-219 (2021)- 2018
- [j47]Sandi Klavzar, D. Azubha Jemilet, Indra Rajasingh, Paul D. Manuel, N. Parthiban:
General Transmission Lemma and Wiener complexity of triangular grids. Appl. Math. Comput. 338: 115-122 (2018) - 2017
- [j44]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) - 2016
- [j40]Indra Rajasingh, Bharati Rajan, Joice Punitha, Paul D. Manuel:
Total-Kernel in Oriented Circular Ladder and Mobius Ladder. Ars Comb. 126: 337-349 (2016) - [j39]Indra Rajasingh, Paul D. Manuel, N. Parthiban, D. Azubha Jemilet, R. Sundara Rajan:
Transmission in Butterfly Networks. Comput. J. 59(8): 1174-1179 (2016) - 2015
- [j36]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) - [j34]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) - [j31]R. Sundara Rajan, Paul D. Manuel, Indra Rajasingh:
Embeddings Between Hypercubes and Hypertrees. J. Graph Algorithms Appl. 19(1): 361-373 (2015) - [j27]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) - [c7]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
- [j24]Bharati Rajan, Indra Rajasingh, Jude Annie Cynthia, Paul D. Manuel:
Metric dimension of directed graphs. Int. J. Comput. Math. 91(7): 1397-1406 (2014) - [c6]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
- [j22]Paul D. Manuel, Bharati Rajan, Indra Rajasingh, P. Vasanthi Beulah:
Improved Bounds on the Crossing Number of Butterfly Network. Discret. Math. Theor. Comput. Sci. 15(2): 87-94 (2013) - [j21]Indra Rajasingh, Paul D. Manuel, Micheal Arockiaraj, Bharati Rajan:
Embeddings of circulant networks. J. Comb. Optim. 26(1): 135-151 (2013) - 2012
- [j18]Indra Rajasingh, Paul D. Manuel, Bharati Rajan, Micheal Arockiaraj:
Wirelength of hypercubes into certain trees. Discret. Appl. Math. 160(18): 2778-2786 (2012) - [j15]Indra Rajasingh, Micheal Arockiaraj, Bharati Rajan, Paul D. Manuel:
Minimum wirelength of hypercubes into n-dimensional grid networks. Inf. Process. Lett. 112(14-15): 583-586 (2012) - [j14]Paul D. Manuel, Indra Rajasingh, R. Sundara Rajan:
Embedding Variants of Hypercubes with Dilation 2. J. Interconnect. Networks 13(1-2) (2012) - 2011
- [j13]Paul D. Manuel, Indra Rajasingh:
Minimum Metric Dimension of Silicate Networks. Ars Comb. 98: 501-510 (2011) - [j12]Paul D. Manuel, Bharati Rajan, Indra Rajasingh, Chris Monica M.:
Landmarks in Binary Tree Derived Architectures. Ars Comb. 99: 473-486 (2011) - [j11]Paul D. Manuel, Micheal Arockiaraj, Indra Rajasingh, Bharati Rajan:
Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength. Discret. Appl. Math. 159(17): 2109-2116 (2011) - [j10]Micheal Arockiaraj, Paul D. Manuel, Indra Rajasingh, Bharati Rajan:
Wirelength of 1-fault hamiltonian graphs into wheels and fans. Inf. Process. Lett. 111(18): 921-925 (2011) - [j9]Indra Rajasingh, Micheal Arockiaraj, Bharati Rajan, Paul D. Manuel:
Circular wirelength of Generalized Petersen Graphs. J. Interconnect. Networks 12(4): 319-336 (2011) - 2009
- [j7]Paul D. Manuel, Indra Rajasingh, Bharati Rajan, Helda Mercy:
Exact wirelength of hypercubes on a grid. Discret. Appl. Math. 157(7): 1486-1495 (2009) - [c3]Paul D. Manuel, Indra Rajasingh, Bharati Rajan, Joice Punitha:
Kernel in Oriented Circulant Graphs. IWOCA 2009: 396-407 - 2008
- [j6]Paul D. Manuel, Mostafa I. Abd-El-Barr, Indra Rajasingh, Bharati Rajan:
An efficient representation of Benes networks and its applications. J. Discrete Algorithms 6(1): 11-19 (2008) - [j5]Paul D. Manuel, Bharati Rajan, Indra Rajasingh, Chris Monica M.:
On minimum metric dimension of honeycomb networks. J. Discrete Algorithms 6(1): 20-27 (2008) - 2006
- [c2]Paul D. Manuel, Indra Rajasingh, Bharati Rajan, Albert Muthumalai:
On Induced Matching Partitions of Certain Interconnection Networks. FCS 2006: 57-63 - 2004
- [j3]Indra Rajasingh, Albert William, Jasintha Quadras, Paul D. Manuel:
Embedding of cycles and wheels into arbitrary trees. Networks 44(3): 173-178 (2004) - 2003
- [j2]Albert William, Indra Rajasingh, Jasintha Quadras, Paul D. Manuel:
Embedding of Generalized Wheels into Arbitrary Trees. Electron. Notes Discret. Math. 15: 228-231 (2003) - [c1]Paul D. Manuel, Bharati Rajan, Indra Rajasingh, Amutha Alaguvel:
Tree Spanners, Cayley Graphs, and Diametrically Uniform Graphs. WG 2003: 334-345
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-02-07 03:15 CET 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:
