We stand with Ukraine  

V. Swaminathan

Orcid: 0000-0002-5840-2040

Affiliations:
  • Saraswathi Narayanan College, Department of Mathematics, Madurai, India


According to our database1, V. Swaminathan authored at least 22 papers between 2003 and 2025.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Maximal point set domination in graphs.
[BibTeX]
[DOI]
R. Sumathi
,
K. Angaleeswari
,
Raman Sundareswaran
,
V. Swaminathan
Discret. Math. Algorithms Appl., January, 2025

Selection of an Optimal Warehouses Using Global Regular Domination in Graphs.
[BibTeX]
[DOI]
Raman Sundareswaran
,
M. Shanmugapriya
,
Ammar Alsinai
,
N. Venkataraman
,
V. Swaminathan
,
Hanan Ahmed
Int. J. Math. Math. Sci., 2025

2024
Weakly connected resolving sets in graphs.
[BibTeX]
[DOI]
J. Sivakumar
,
A. Wilson Baskar
,
Raman Sundareswaran
,
V. Swaminathan
Discret. Math. Algorithms Appl., November, 2024

Locating fair domination in graphs.
[BibTeX]
[DOI]
V. Swaminathan
,
Raman Sundareswaran
,
L. Muthusubramanian
Discret. Math. Algorithms Appl., August, 2024

2023
Secure equitability in graphs.
[BibTeX]
[DOI]
L. Muthusubramanian
,
Raman Sundareswaran
,
V. Swaminathan
Discret. Math. Algorithms Appl., February, 2023

2022
Outer complete fair domination in graphs.
[BibTeX]
[DOI]
V. Swaminathan
,
Raman Sundareswaran
,
D. Lalkshmanaraj
,
L. Muthusubramanian
Discret. Math. Algorithms Appl., 2022

2021
Complementary equitably totally disconnected equitable domination in graphs.
[BibTeX]
[DOI]
P. Nataraj
,
Raman Sundareswaran
,
V. Swaminathan
Discret. Math. Algorithms Appl., 2021

Equitable fair domination in graphs.
[BibTeX]
[DOI]
V. Swaminathan
,
Raman Sundareswaran
,
D. Lakshmanaraj
,
P. Nataraj
,
L. Muthusubramanian
Discret. Math. Algorithms Appl., 2021

2010
A Simple Algorithm for Maximum Clique and Matching Protein Structures.
[BibTeX]
[DOI]
S. Balaji
,
V. Swaminathan
,
K. Kannan
Int. J. Comb. Optim. Probl. Informatics, 2010

2009
A Note on Incidence graphs.
[BibTeX]
[DOI]
N. Venkataraman
,
Raman Sundareswaran
,
V. Swaminathan
Electron. Notes Discret. Math., 2009

Weakly Connected Domination in Graphs.
[BibTeX]
[DOI]
V. Swaminathan
Electron. Notes Discret. Math., 2009

Properties of topological spaces associated with sigraphs.
[BibTeX]
[DOI]
S. P. Subbiah
,
V. Swaminathan
Electron. Notes Discret. Math., 2009

Strong non split r-domination number of a graph.
[BibTeX]
[DOI]
A. P. Pushpalatha
,
S. Suganthi
,
G. Jothilakshmi
,
V. Swaminathan
Electron. Notes Discret. Math., 2009

New parameters involving chromatic sum in a graph.
[BibTeX]
[DOI]
Emmanuel Jebarajan
,
Raman Sundareswaran
,
V. Swaminathan
Electron. Notes Discret. Math., 2009

(m, e)-domination in Semigraphs.
[BibTeX]
[DOI]
S. Gomathi
,
Raman Sundareswaran
,
V. Swaminathan
Electron. Notes Discret. Math., 2009

2004
Gracefulness of Pa, b.
[BibTeX]
C. Sekar
,
V. Swaminathan
Ars Comb., 2004

2003
Strong and weak domination in graphs.
[BibTeX]
[DOI]
V. Swaminathan
,
P. Thangaraju
Electron. Notes Discret. Math., 2003

Gallai-type theorems in domination and strong domination parameters.
[BibTeX]
[DOI]
V. Swaminathan
,
P. Thangaraju
Electron. Notes Discret. Math., 2003

Subdivision Number of Graphs and Falsity of a conjecture.
[BibTeX]
[DOI]
V. Swaminathan
,
P. Sumathi
Electron. Notes Discret. Math., 2003

Point Set and Strong Point Set Domination in Graphs 1 Minimum spsd sets.
[BibTeX]
[DOI]
V. Swaminathan
,
R. Poovazhaki
Electron. Notes Discret. Math., 2003

Super Edge - Magic Strength of Fire Crackers, Banana Trees and Unicyclic Graphs.
[BibTeX]
[DOI]
V. Swaminathan
,
P. Jeyanthi
Electron. Notes Discret. Math., 2003

Phi-Strong (weak) domination in a graph.
[BibTeX]
V. Swaminathan
,
P. Thangaraju
Ars Comb., 2003


  Loading...