V. Swaminathan

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


According to our database1, V. Swaminathan authored at least 18 papers between 2003 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Secure equitability in graphs.
Discret. Math. Algorithms Appl., February, 2023

2022
Outer complete fair domination in graphs.
Discret. Math. Algorithms Appl., 2022

2021
Complementary equitably totally disconnected equitable domination in graphs.
Discret. Math. Algorithms Appl., 2021

Equitable fair domination in graphs.
Discret. Math. Algorithms Appl., 2021

2010
A Simple Algorithm for Maximum Clique and Matching Protein Structures.
Int. J. Comb. Optim. Probl. Informatics, 2010

2009
A Note on Incidence graphs.
Electron. Notes Discret. Math., 2009

Weakly Connected Domination in Graphs.
Electron. Notes Discret. Math., 2009

Properties of topological spaces associated with sigraphs.
Electron. Notes Discret. Math., 2009

Strong non split r-domination number of a graph.
Electron. Notes Discret. Math., 2009

New parameters involving chromatic sum in a graph.
Electron. Notes Discret. Math., 2009

(m, e)-domination in Semigraphs.
Electron. Notes Discret. Math., 2009

2004
Gracefulness of Pa, b.
Ars Comb., 2004

2003
Strong and weak domination in graphs.
Electron. Notes Discret. Math., 2003

Gallai-type theorems in domination and strong domination parameters.
Electron. Notes Discret. Math., 2003

Subdivision Number of Graphs and Falsity of a conjecture.
Electron. Notes Discret. Math., 2003

Point Set and Strong Point Set Domination in Graphs 1 Minimum spsd sets.
Electron. Notes Discret. Math., 2003

Super Edge - Magic Strength of Fire Crackers, Banana Trees and Unicyclic Graphs.
Electron. Notes Discret. Math., 2003

Phi-Strong (weak) domination in a graph.
Ars Comb., 2003


  Loading...