Open Access
Research Article·pp. 3409–3418·Vol. 29, Issue 9-ASep 2026
Unveiling strong domination number on some graphs
Slashi Leel, Sweta Srivastav, Sangeeta Gupta
Published Online: 30 Sep 2026DOI: 10.47974/JDMSC-2855
In this paper: Let G = (V, E) be the given graph, a subset D ⊆ V is defined as the dominating set if every vertices in the set (V-D) is adjacent to at least one vertex in the set D. Then the set D is known as the Do...
