V. Swaminathan

According to our database, V. Swaminathan authored at least 24 papers between 2003 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2026

A characterization of almost-2-distance-hereditary graphs in terms of their forbidden subgraphs.

Sakander Hayat, Raman Sundareswaran, M. Shanmugapriya, P. Amalorpavamary, Asad Khan, Taoufik Saidani, V. Swaminathan

Comput. Appl. Math., December, 2026

Distance-Hereditary Properties in Product Graphs.

P. Amalorpavamary, Raman Sundareswaran, M. Shanmugapriya, V. Swaminathan

J. Interconnect. Networks, June, 2026

2025

Maximal point set domination in graphs.

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.

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.

J. Sivakumar, A. Wilson Baskar, Raman Sundareswaran, V. Swaminathan

Discret. Math. Algorithms Appl., November, 2024

Locating fair domination in graphs.

V. Swaminathan, Raman Sundareswaran, L. Muthusubramanian

Discret. Math. Algorithms Appl., August, 2024

2023

Secure equitability in graphs.

L. Muthusubramanian, Raman Sundareswaran, V. Swaminathan

Discret. Math. Algorithms Appl., February, 2023

2022

Outer complete fair domination in graphs.

V. Swaminathan, Raman Sundareswaran, D. Lalkshmanaraj, L. Muthusubramanian

Discret. Math. Algorithms Appl., 2022

2021

Complementary equitably totally disconnected equitable domination in graphs.

P. Nataraj, Raman Sundareswaran, V. Swaminathan

Discret. Math. Algorithms Appl., 2021

Equitable fair domination in graphs.

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.

S. Balaji, V. Swaminathan, K. Kannan

Int. J. Comb. Optim. Probl. Informatics, 2010

2009

A Note on Incidence graphs.

N. Venkataraman, Raman Sundareswaran, V. Swaminathan

Electron. Notes Discret. Math., 2009

Weakly Connected Domination in Graphs.

V. Swaminathan

Electron. Notes Discret. Math., 2009

Properties of topological spaces associated with sigraphs.

S. P. Subbiah, V. Swaminathan

Electron. Notes Discret. Math., 2009

Strong non split r-domination number of a graph.

A. P. Pushpalatha, S. Suganthi, G. Jothilakshmi, V. Swaminathan

Electron. Notes Discret. Math., 2009

New parameters involving chromatic sum in a graph.

Emmanuel Jebarajan, Raman Sundareswaran, V. Swaminathan

Electron. Notes Discret. Math., 2009

(m, e)-domination in Semigraphs.

S. Gomathi, Raman Sundareswaran, V. Swaminathan

Electron. Notes Discret. Math., 2009

2004

Gracefulness of Pa, b.

C. Sekar, V. Swaminathan

Ars Comb., 2004

2003

Strong and weak domination in graphs.

V. Swaminathan, P. Thangaraju

Electron. Notes Discret. Math., 2003

Gallai-type theorems in domination and strong domination parameters.

V. Swaminathan, P. Thangaraju

Electron. Notes Discret. Math., 2003

Subdivision Number of Graphs and Falsity of a conjecture.

V. Swaminathan, P. Sumathi

Electron. Notes Discret. Math., 2003

Point Set and Strong Point Set Domination in Graphs 1 Minimum spsd sets.

V. Swaminathan, R. Poovazhaki

Electron. Notes Discret. Math., 2003

Super Edge - Magic Strength of Fire Crackers, Banana Trees and Unicyclic Graphs.

V. Swaminathan, P. Jeyanthi

Electron. Notes Discret. Math., 2003

Phi-Strong (weak) domination in a graph.

V. Swaminathan, P. Thangaraju

Ars Comb., 2003