TARU PUBLICATIONS
Author

S. Prabhu

Department of Mathematics, Rajalakshmi Engineering College, Chennai, Tamil Nadu, 602105, India

Published papers
3
Citations
1
Views
1,825
Downloads
450

Publications

3 papers
Open Access Research Article·pp. 2211–2221·Vol. 29, Issue 6Jun 2026

Secure domination of mesh and pyramid networks

Merlin Thomas, V. Jude Annie Cynthia, S. Prabhu, R. Sundara Rajan

Published Online: 13 Jun 2026DOI: 10.47974/JDMSC-2392

In this paper: Given a dominating set S ⊆ V(G) for a graph G, each vertex of the graph is either in S or is adjacent to at least one vertex in S. The set S is a secure dominating set of G if, for each vertex u ∈ V(G...

AbstractReferencesFull Text PDF (963 KB)Views: 347Downloads: 175Citations: 0
Open Access Research Article·pp. 29–42·Vol. 28, Issue 1Feb 2025

On the central resolver set of the edge coronation graphs

Liliek Susilowati, Slamin Slamin, Utik Maulida, Nenik Estuningsih, Siti Zahidah, S. Prabhu

Published Online: 28 Feb 2025DOI: 10.47974/JDMSC-1819

In this paper: Graph theory as part of mathematics, has experienced significant development from the theoretical aspect, one of it is the theory of metric dimension. The concept of metric dimensions has evolved grea...

AbstractReferencesFull Text PDF (409 KB)Views: 414Downloads: 117Citations: 1
Open Access Research Article·pp. 1045–1058·Vol. 27, Issue 3Apr 2024

Certain domination numbers for Cartesian product of graphs

S. Arulanand, R. Sundara Rajan, S. Prabhu, Sudeep Stephen

Published Online: 02 Apr 2024DOI: 10.47974/JDMSC-1720

In this paper: Let G be a network, any node v ϵ V(G)\D  is adjacent to atleast one node in D, then the set D is named a dominating set, represented by γ(G).  A set D of nodes in a network G is called an independent...

AbstractReferencesFull Text PDF (925 KB)Views: 1,064Downloads: 158Citations: 0