Secure Domination Subdivision Number of a Graph

Let G = (V,E) be a graph of order n and size m. A dominating set S of G is called a secure dominating set if for each u ∈ V ∖S there exists v ∈ S such that v is adjacent to u and (S∖{v}) ∪{u} is a ...