Any suggestions about a known NP-complete problem that can be reduced to the following problem?
This problem is called Dominating Set, and as pointed out by Raphael in the comments it's a special case of Set Cover (for each vertex, create a set for it and its neighbours).  It's NP-hard.