Open Access
Research Article·pp. 2723–2736·Vol. 28, Issue 7Oct 2025
Secure 2-domination in graphs
Ibrahim Boufelgha, Moussa Ahmia, Mourad Guettiche
Published Online: 12 Jul 2025DOI: 10.47974/JDMSC-2067
In this paper: Let G = (V, E) be a simple graph. A set D ⊆ V is a dominating set of G if every vertex in V\D is adjacent to at least one vertex in D. D is a 2-dominating set if every vertex in V\D has at least two n...
