This paper is motivated by the concept of the signed k-domination problem and dedicated to the complexity of the problem......

A set D of vertices of a graph G = (V, E) is called k-dominating if every vertex v ∈V-D is adjacent to some k vertices ......