default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDS. Monikandan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j19]S. Devi, S. Monikandan:
Recognition of finite bitopological spaces with no isolated point. Soft Comput. 27(17): 12049-12056 (2023)- 2022
- [j18]P. Anusha Devi, S. Monikandan:
Degree Associated Edge Reconstruction Parameters of Strong Double Brooms. J. Autom. Lang. Comb. 27(4): 259-269 (2022) - 2021
- [j17]S. Monikandan, A. Anu:
Reconstruction number of graphs with unique pendant vertex. Discret. Appl. Math. 305: 357-365 (2021) - 2020
- [j16]N. Kalai Mathi, S. Monikandan:
Degree associated edge reconstruction number of split graphs with biregular independent set is one. AKCE Int. J. Graphs Comb. 17(3): 771-776 (2020) - [j15]P. Anusha Devi, S. Monikandan:
Graphs with arbitrarily large adversary degree associated reconstruction number. AKCE Int. J. Graphs Comb. 17(3): 1045-1051 (2020)
2010 – 2019
- 2018
- [j14]P. Devi Priya
, S. Monikandan:
Reconstruction of distance hereditary 2-connected graphs. Discret. Math. 341(8): 2326-2331 (2018) - 2017
- [j13]P. Anusha Devi, S. Monikandan:
Degree Associated Reconstruction Number of Graphs with Regular Pruned Graph. Ars Comb. 134: 29-41 (2017) - [j12]P. Anusha Devi, S. Monikandan:
Degree Associated Reconstruction Parameters of Total Graphs. Contributions Discret. Math. 12(2) (2017) - 2016
- [j11]P. Anusha Devi, S. Monikandan:
Degree associated reconstruction number of connected digraphs with unique end vertex. Australas. J Comb. 66: 365-377 (2016) - [j10]S. Monikandan, J. Balakumar:
On pairs of graphs having n-2 cards in common. Ars Comb. 124: 289-302 (2016) - [j9]A. Anu, S. Monikandan:
Degree associated reconstruction number of certain connected graphs with unique end vertex and a vertex of degree n-2. Discret. Math. Algorithms Appl. 8(4): 1650068:1-1650068:13 (2016) - [c4]A. Anu, S. Monikandan:
Degree Associated Reconstruction Number of Biregular Bipartite Graphs Whose Degrees Differ by at Least Two. ICTCSDM 2016: 1-9 - [c3]N. Kalai Mathi, S. Monikandan:
Degree Associated Reconstruction Number of Split Graphs with Regular Independent Set. ICTCSDM 2016: 106-112 - 2015
- [j8]S. Monikandan, S. Sundar Raj:
Adversary degree associated reconstruction number of graphs. Discret. Math. Algorithms Appl. 7(1): 1450069:1-1450069:16 (2015) - [j7]P. Anusha Devi, S. Monikandan:
Degree Associated Edge Reconstruction Number of Graphs with Regular Pruned Graph. Electron. J. Graph Theory Appl. 3(2): 146-161 (2015) - 2014
- [j6]J. Balakumar, S. Monikandan:
A reduction of the Graph Reconstruction Conjecture. Discuss. Math. Graph Theory 34(3): 529-537 (2014) - 2013
- [j5]S. Ramachandran, S. Monikandan:
Pairs of graphs having n-2 cards in common. Ars Comb. 112: 213-224 (2013) - [j4]S. Monikandan, P. Anusha Devi, S. Sundar Raj:
Degree associated edge reconstruction number of graphs. J. Discrete Algorithms 23: 35-41 (2013) - 2012
- [j3]S. Monikandan, J. Balakumar:
Reconstruction of bipartite graphs and triangle-free graphs with connectivity two. Australas. J Comb. 53: 141-150 (2012) - [c2]S. Monikandan, S. Sundar Raj:
Degree Associated Edge Reconstruction Number. IWOCA 2012: 100-109
2000 – 2009
- 2009
- [j2]S. Ramachandran, S. Monikandan:
A sufficient condition for Set Reconstruction. Ars Comb. 91 (2009) - [c1]K. Geetha, N. A. Gounden, S. Monikandan:
SEMALRU: An Implementation of Modified Web Cache Replacement Algorithm. NaBIC 2009: 1406-1410 - 2007
- [j1]S. Ramachandran, S. Monikandan:
All graphs are set reconstructible if all 2-connected graphs are set reconstructible. Ars Comb. 83 (2007)
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-04-24 22:50 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:
