Suppose further that each vertex s ∈ V is associated with a weight w v .
the max k -weighted dominating set problem consists in determining a subset of vertices of total weight k that are adjacent with the maximum number of vertices in G. if we set w v = 1 for each vertex, then the two problems are identical, showing the corresponding NP-hardness of this weighted version of the problem.