default search action
V. Swaminathan 0001
Person information
- affiliation: Saraswathi Narayanan College, Department of Mathematics, Madurai, India
Other persons with the same name
- Swaminathan Venkatraman 0002
(aka: V. Swaminathan 0002) — SASTRA University, Kumbakonam, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j20]V. Swaminathan, Raman Sundareswaran
Locating fair domination in graphs. Discret. Math. Algorithms Appl. 16(6): 2350069:1-2350069:10 (2024) - 2023
- [j19]L. Muthusubramanian
Secure equitability in graphs. Discret. Math. Algorithms Appl. 15(2): 2250081:1-2250081:21 (2023) - 2022
- [j18]V. Swaminathan, Raman Sundareswaran
Outer complete fair domination in graphs. Discret. Math. Algorithms Appl. 14(3): 2150126:1-2150126:10 (2022) - 2021
- [j17]P. Nataraj
Complementary equitably totally disconnected equitable domination in graphs. Discret. Math. Algorithms Appl. 13(4): 2150043:1-2150043:12 (2021) - [j16]V. Swaminathan, Raman Sundareswaran
Equitable fair domination in graphs. Discret. Math. Algorithms Appl. 13(6): 2150083:1-2150083:7 (2021)
2010 – 2019
- 2010
- [j15]S. Balaji, V. Swaminathan, K. Kannan:
A Simple Algorithm for Maximum Clique and Matching Protein Structures. Int. J. Comb. Optim. Probl. Informatics 1(2): 2-11 (2010)
2000 – 2009
- 2009
- [j14]A. P. Pushpalatha
Strong non split r-domination number of a graph. Electron. Notes Discret. Math. 33: 51-57 (2009) - [j13]S. P. Subbiah, V. Swaminathan:
Properties of topological spaces associated with sigraphs. Electron. Notes Discret. Math. 33: 59-66 (2009) - [j12]V. Swaminathan:
Weakly Connected Domination in Graphs. Electron. Notes Discret. Math. 33: 67-73 (2009) - [j11]S. Gomathi, Raman Sundareswaran
(m, e)-domination in Semigraphs. Electron. Notes Discret. Math. 33: 75-80 (2009) - [j10]Emmanuel Jebarajan, Raman Sundareswaran
New parameters involving chromatic sum in a graph. Electron. Notes Discret. Math. 33: 81-86 (2009) - [j9]N. Venkataraman, Raman Sundareswaran
A Note on Incidence graphs. Electron. Notes Discret. Math. 33: 87-93 (2009) - 2006
- [j8]V. Swaminathan, P. Jeyanthi
Super edge-magic strength of fire crackers, banana trees and unicyclic graphs. Discret. Math. 306(14): 1624-1636 (2006) - 2004
- [j7]C. Sekar, V. Swaminathan:
Gracefulness of Pa, b. Ars Comb. 72 (2004) - 2003
- [j6]V. Swaminathan, P. Thangaraju:
Phi-Strong (weak) domination in a graph. Ars Comb. 69 (2003) - [j5]V. Swaminathan, P. Jeyanthi
Super Edge - Magic Strength of Fire Crackers, Banana Trees and Unicyclic Graphs. Electron. Notes Discret. Math. 15: 205-206 (2003) - [j4]V. Swaminathan, R. Poovazhaki:
Point Set and Strong Point Set Domination in Graphs 1 Minimum spsd sets. Electron. Notes Discret. Math. 15: 207-210 (2003) - [j3]V. Swaminathan, P. Thangaraju:
Gallai-type theorems in domination and strong domination parameters. Electron. Notes Discret. Math. 15: 211 (2003) - [j2]V. Swaminathan, P. Sumathi:
Subdivision Number of Graphs and Falsity of a conjecture. Electron. Notes Discret. Math. 15: 212 (2003) - [j1]V. Swaminathan, P. Thangaraju:
Strong and weak domination in graphs. Electron. Notes Discret. Math. 15: 213-215 (2003)
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-07 21:14 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: