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...
