


default search action
Purnima Gupta
Person information
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j23]Purnima Gupta, Alka Goyal, S. Arumugam
:
Line-set domination in graphs. Discret. Math. Algorithms Appl. 15(5): 2250117:1-2250117:6 (2023) - 2022
- [j22]Rajesh Singh, Purnima Gupta, S. Arumugam
:
Truly non-trivial graphoidal graphs. AKCE Int. J. Graphs Comb. 19(2): 112-117 (2022) - [j21]Deepti Jain, Purnima Gupta:
Independent 2-point set domination in graphs - II. AKCE Int. J. Graphs Comb. 19(3): 201-205 (2022) - [j20]Purnima Gupta, Deepti Jain
:
2-Point set domination in separable graphs. Discret. Math. Algorithms Appl. 14(8): 2250044:1-2250044:16 (2022) - 2021
- [j19]Purnima Gupta, Deepti Jain:
Graphoidally independent infinite graphs. AKCE Int. J. Graphs Comb. 18(2): 95-100 (2021) - [j18]Purnima Gupta, Alka Goyal, Ranjana Jain:
Independent point-set domination in line graphs. AKCE Int. J. Graphs Comb. 18(3): 180-185 (2021) - 2020
- [j17]Purnima Gupta, Alka Goyal, Ranjana Jain:
Independent point-set dominating sets in graphs. AKCE Int. J. Graphs Comb. 17(1): 229-241 (2020) - [j16]Purnima Gupta, Rajesh Singh, S. Arumugam
:
Graphs with equal domination and independent domination numbers. AKCE Int. J. Graphs Comb. 17(2): 691-696 (2020) - [j15]Purnima Gupta, Megha Agarwal, Rajesh Singh:
On graphoidal length of a tree in terms of its diameter. AKCE Int. J. Graphs Comb. 17(3): 703-707 (2020)
2010 – 2019
- 2018
- [j14]Purnima Gupta, Rajesh Singh:
Domination in graphoidally covered graphs: Least-kernel graphoidal graphs-II. AKCE Int. J. Graphs Comb. 15(1): 63-71 (2018) - [j13]Purnima Gupta, Deepti Jain
:
Bounds on 2-point set domination number of a graph. Discret. Math. Algorithms Appl. 10(1): 1850012:1-1850012:15 (2018) - 2017
- [j12]Deepti Jain
, Purnima Gupta, S. Arumugam
:
Minimal 2-point set dominating sets of a graph. AKCE Int. J. Graphs Comb. 14(2): 135-141 (2017) - 2016
- [j11]Purnima Gupta, Rajesh Singh
, S. Arumugam
:
Characterizing minimal point set dominating sets. AKCE Int. J. Graphs Comb. 13(3): 283-289 (2016) - [j10]S. Arumugam
, Purnima Gupta, Rajesh Singh:
Bounds on Graphoidal Length of a Graph. Electron. Notes Discret. Math. 53: 113-122 (2016) - [j9]Purnima Gupta, Deepti Jain
:
Global 2-Point Set Domination Number of a Graph. Electron. Notes Discret. Math. 53: 213-224 (2016) - [j8]Purnima Gupta, Rajesh Singh:
Domination in Graphoidally Covered Graphs: Least-Kernel Graphoidal Covers. Electron. Notes Discret. Math. 53: 433-444 (2016) - [c5]Purnima Gupta, Deepti Jain:
Independent 2-Point Set Domination in Graphs. ICTCSDM 2016: 281-288 - [c4]Purnima Gupta, Rajesh Singh:
On Graphs Whose Graphoidal Length Is Half of Its Size. ICTCSDM 2016: 289-299 - [c3]Purnima Gupta, Alka Goyal, Rajesh Singh:
Point-Set Domination in Graphs. VIII: Perfect and Efficient PSD Sets. ICTCSDM 2016: 300-304 - [c2]Purnima Gupta, Rajesh Singh, S. Arumugam
:
Graphoidal Length and Graphoidal Covering Number of a Graph. ICTCSDM 2016: 305-311 - 2015
- [j7]B. Devadas Acharya, Purnima Gupta, Deepti Jain
:
On graphs whose graphoidal domination number is one. AKCE Int. J. Graphs Comb. 12(Issues): 133-140 (2015) - [j6]Mukti Acharya, Pranjali, Purnima Gupta:
Zero Ring Labeling of Graphs. Electron. Notes Discret. Math. 48: 65-72 (2015) - [j5]Pranjali, Mukti Acharya, Purnima Gupta:
Finite Abelian Group Labeling. Electron. Notes Discret. Math. 48: 255-258 (2015)
2000 – 2009
- 2007
- [c1]Purnima Gupta, Nitendra Rajput:
Two-stream emotion recognition for call center monitoring. INTERSPEECH 2007: 2241-2244 - 2003
- [j4]B. Devadas Acharya, Purnima Gupta:
On graphs whose domination numbers equal their independent domination numbers. Electron. Notes Discret. Math. 15: 2-4 (2003) - [j3]E. Sampathkumar
, B. Devadas Acharya, Purnima Gupta:
Studying Properties of Graphs through Their k-vertex Subsets II. Notions of domination, coloring and covering. Electron. Notes Discret. Math. 15: 168-174 (2003)
1990 – 1999
- 1999
- [j2]B. Devadas Acharya, Purnima Gupta:
On point-set domination in graphs IV: Separable graphs with unique minimum psd-sets. Discret. Math. 195(1-3): 1-13 (1999) - [j1]B. Devadas Acharya, Purnima Gupta:
Domination in graphoidal covers of a graph. Discret. Math. 206(1-3): 3-33 (1999)
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-21 00:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint