default search action
P. Roushini Leely Pushpam
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j19]P. Roushini Leely Pushpam, M. Kamalam, B. Mahavir
:
Stability of certified domination upon edge addition. Discret. Math. Algorithms Appl. 16(6): 2350068:1-2350068:8 (2024) - [j18]P. Roushini Leely Pushpam, K. Priya Bhanthavi:
More on independent transversal domination. Discret. Math. Algorithms Appl. 16(7): 2350082:1-2350082:15 (2024) - 2022
- [j17]P. Roushini Leely Pushpam, N. Srilakshmi
Weak Roman subdivision number of graphs. Discret. Math. Algorithms Appl. 14(2): 2150102:1-2150102:10 (2022) - [j16]P. Roushini Leely Pushpam, B. Mahavir
Resolving Roman domination in graphs. Discret. Math. Algorithms Appl. 14(7): 2250028:1-2250028:9 (2022) - 2021
- [j15]P. Roushini Leely Pushpam, K. Priya Bhanthavi:
The stability of independent transversal domination in trees. Discret. Math. Algorithms Appl. 13(1): 2050097:1-2050097:10 (2021) - 2020
- [j14]B. Mahavir
An algorithm to recognize weak roman domination stable trees under vertex deletion. Discret. Math. Algorithms Appl. 12(4): 2050049:1-2050049:16 (2020) - [c3]P. Roushini Leely Pushpam, N. Srilakshmi
Weak Roman Bondage Number of a Graph. CALDAM 2020: 156-166
2010 – 2019
- 2019
- [j13]P. Roushini Leely Pushpam, M. Kamalam:
Effect of vertex deletion on the weak Roman domination number of a graph. AKCE Int. J. Graphs Comb. 16(2): 204-212 (2019) - 2018
- [j12]P. Roushini Leely Pushpam, Chitra Suseendran:
m-Secure vertex cover of a graph. Discret. Math. Algorithms Appl. 10(6): 1850075:1-1850075:15 (2018) - 2017
- [j11]P. Roushini Leely Pushpam, Chitra Suseendran:
Secure vertex cover of a graph. Discret. Math. Algorithms Appl. 9(2): 1750026:1-1750026:17 (2017) - 2016
- [j10]P. Roushini Leely Pushpam, Padmapriea Sampath:
Global Roman domination in graphs. Discret. Appl. Math. 200: 176-185 (2016) - [j9]P. Roushini Leely Pushpam, Pa. Shanthi:
m-Eternal total domination in graphs. Discret. Math. Algorithms Appl. 8(3): 1650055:1-1650055:14 (2016) - [j8]P. Roushini Leely Pushpam, Pa. Shanthi:
Changing and Unchanging in m-Eternal Total Domination in Graphs. Electron. Notes Discret. Math. 53: 181-198 (2016) - [j7]P. Roushini Leely Pushpam, K. Priya Bhanthavi:
The Independent Transversal Dombondage Number of a Graph. Electron. Notes Discret. Math. 53: 199-211 (2016) - [c2]P. Roushini Leely Pushpam, Padmapriea Sampath:
On Total Roman Domination in Graphs. ICTCSDM 2016: 326-331 - [c1]P. Roushini Leely Pushpam, D. Yokesh:
Restrained Differential of a Graph. ICTCSDM 2016: 332-340 - 2015
- [j6]P. Roushini Leely Pushpam, Chitra Suseendran:
Secure Restrained Domination in Graphs. Math. Comput. Sci. 9(2): 239-247 (2015) - 2012
- [j5]P. Roushini Leely Pushpam, A. Saibulla:
On super (a, d)-edge antimagic total labeling of certain families of graphs. Discuss. Math. Graph Theory 32(3): 535-543 (2012) - 2011
- [j4]P. Roushini Leely Pushpam, T. N. M. Malini Mai:
Weak edge Roman domination in graphs. Australas. J Comb. 51: 125-138 (2011) - [j3]T. N. M. Malini Mai, P. Roushini Leely Pushpam:
Weak Roman domination in graphs. Discuss. Math. Graph Theory 31(1): 161-170 (2011)
2000 – 2009
- 2004
- [j2]S. Arumugam, Indra Rajasingh, P. Roushini Leely Pushpam:
On Graphs Whose Acyclic Graphoidal Covering Number Is One Less Than Its Cyclomatic Number. Ars Comb. 72 (2004) - 2001
- [j1]S. Arumugam
Graphs whose acyclic graphoidal covering number is one less than its maximum degree. Discret. Math. 240(1-3): 231-237 (2001)
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-10 21:18 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: