Phi-Strong (weak) domination in a graph. - V. Swaminathan 001; P. Thangaraju (Ars Comb., 2003)

Super Edge - Magic Strength of Fire Crackers, Banana Trees and Unicyclic Graphs. - V. Swaminathan 001; P. Jeyanthi (Electron. Notes Discret. Math., 2003)

Point Set and Strong Point Set Domination in Graphs 1 Minimum spsd sets. - V. Swaminathan 001; R. Poovazhaki (Electron. Notes Discret. Math., 2003)

Subdivision Number of Graphs and Falsity of a conjecture. - V. Swaminathan 001; P. Sumathi (Electron. Notes Discret. Math., 2003)

Gallai-type theorems in domination and strong domination parameters. - V. Swaminathan 001; P. Thangaraju (Electron. Notes Discret. Math., 2003)

Strong and weak domination in graphs. - V. Swaminathan 001; P. Thangaraju (Electron. Notes Discret. Math., 2003)

Gracefulness of Pa, b. - C. Sekar; V. Swaminathan 001 (Ars Comb., 2004)

(m, e)-domination in Semigraphs. - S. Gomathi; Raman Sundareswaran; V. Swaminathan 001 (Electron. Notes Discret. Math., 2009)

New parameters involving chromatic sum in a graph. - Emmanuel Jebarajan; Raman Sundareswaran; V. Swaminathan 001 (Electron. Notes Discret. Math., 2009)

Strong non split r-domination number of a graph. - A. P. Pushpalatha; S. Suganthi; G. Jothilakshmi; V. Swaminathan 001 (Electron. Notes Discret. Math., 2009)

Properties of topological spaces associated with sigraphs. - S. P. Subbiah; V. Swaminathan 001 (Electron. Notes Discret. Math., 2009)

Weakly Connected Domination in Graphs. - V. Swaminathan 001 (Electron. Notes Discret. Math., 2009)

A Note on Incidence graphs. - N. Venkataraman; Raman Sundareswaran; V. Swaminathan 001 (Electron. Notes Discret. Math., 2009)

A Simple Algorithm for Maximum Clique and Matching Protein Structures. - S. Balaji; V. Swaminathan 001; K. Kannan 001 (Int. J. Comb. Optim. Probl. Informatics, 2010)

Equitable fair domination in graphs. - V. Swaminathan 001; Raman Sundareswaran; D. Lakshmanaraj; P. Nataraj; L. Muthusubramanian (Discret. Math. Algorithms Appl., 2021)

Complementary equitably totally disconnected equitable domination in graphs. - P. Nataraj; Raman Sundareswaran; V. Swaminathan 001 (Discret. Math. Algorithms Appl., 2021)

Outer complete fair domination in graphs. - V. Swaminathan 001; Raman Sundareswaran; D. Lalkshmanaraj; L. Muthusubramanian (Discret. Math. Algorithms Appl., 2022)

Secure equitability in graphs. - L. Muthusubramanian; Raman Sundareswaran; V. Swaminathan 001 (Discret. Math. Algorithms Appl., 2023)

Locating fair domination in graphs. - V. Swaminathan 001; Raman Sundareswaran; L. Muthusubramanian (Discret. Math. Algorithms Appl., 2024)

Weakly connected resolving sets in graphs. - J. Sivakumar; A. Wilson Baskar; Raman Sundareswaran; V. Swaminathan 001 (Discret. Math. Algorithms Appl., 2024)

Selection of an Optimal Warehouses Using Global Regular Domination in Graphs. - Raman Sundareswaran; M. Shanmugapriya; Ammar Alsinai; N. Venkataraman; V. Swaminathan 001; Hanan Ahmed (Int. J. Math. Math. Sci., 2025)

Maximal point set domination in graphs. - R. Sumathi; K. Angaleeswari; Raman Sundareswaran; V. Swaminathan 001 (Discret. Math. Algorithms Appl., 2025)