default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDS. Aparna Lakshmanan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j15]Dhanya Roy, Sandi Klavzar
, S. Aparna Lakshmanan:
Mutual-visibility and general position in double graphs and in Mycielskians. Appl. Math. Comput. 488: 129131 (2025)- 2024
- [j14]Jismy Varghese, Anu V., S. Aparna Lakshmanan:
Domination parameters of generalized Sierpiński graphs. AKCE Int. J. Graphs Comb. 21(1): 4-10 (2024) - [j13]S. Aparna Lakshmanan, Merlin Mariya Eldho:
On Leech labelings of graphs and some related concepts. Discret. Math. 347(4): 113837 (2024) - 2022
- [j12]Seena Varghese, S. Aparna Lakshmanan, S. Arumugam:
Two extensions of Leech labeling to the class of all graphs. AKCE Int. J. Graphs Comb. 19(2): 159-165 (2022) - 2021
- [j11]Jismy Varghese, S. Aparna Lakshmanan:
Italian domination on Mycielskian and Sierpinski graphs. Discret. Math. Algorithms Appl. 13(4): 2150037:1-2150037:9 (2021) - 2020
- [j10]Anu V., S. Aparna Lakshmanan:
The double Roman domination number of generalized Sierpiński graphs. Discret. Math. Algorithms Appl. 12(4): 2050047:1-2050047:7 (2020) - [j9]Seena Varghese, S. Aparna Lakshmanan, Subramanian Arumugam:
Two classes of non-Leech trees. Electron. J. Graph Theory Appl. 8(1): 205-210 (2020)
2010 – 2019
- 2018
- [j8]Anu V., S. Aparna Lakshmanan:
Double Roman domination number. Discret. Appl. Math. 244: 198-204 (2018) - 2017
- [j7]Jeepamol J. Palathingal, S. Aparna Lakshmanan:
Gallai and anti-Gallai Graph Operators. Electron. Notes Discret. Math. 63: 447-453 (2017) - 2016
- [j6]S. Aparna Lakshmanan, Csilla Bujtás, Zsolt Tuza:
Induced cycles in triangle graphs. Discret. Appl. Math. 209: 264-275 (2016) - [c1]Anu V., S. Aparna Lakshmanan:
Homometric Number of a Graph and Some Related Concepts. ICTCSDM 2016: 30-37 - 2015
- [j5]S. Aparna Lakshmanan, Csilla Bujtás, Zsolt Tuza:
Generalized Line Graphs: Cartesian Products and Complexity of Recognition. Electron. J. Comb. 22(3): 3 (2015) - 2012
- [j4]S. Aparna Lakshmanan, Csilla Bujtás, Zsolt Tuza:
Small Edge Sets Meeting all Triangles of a Graph. Graphs Comb. 28(3): 381-392 (2012) - 2010
- [j3]S. B. Rao, S. Aparna Lakshmanan, Ambat Vijayakumar:
Cographic and global cographic domination number of a graph. Ars Comb. 95 (2010)
2000 – 2009
- 2009
- [j2]S. Aparna Lakshmanan, Ambat Vijayakumar:
The (t)-property of some classes of graphs. Discret. Math. 309(1): 259-263 (2009) - 2008
- [j1]S. Aparna Lakshmanan, Ambat Vijayakumar:
Clique irreducibility of some iterative classes of graphs. Discuss. Math. Graph Theory 28(2): 307-321 (2008)
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 2025-01-09 13:10 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:
