Given an undirected graph G = (V,E), does there exist a set D ⊆ V of size k such that every v ∈ V is either in D or adjacent to at least one member of D.
Show that DS∈NPC. You may only assume that VC is known to be NP-Complete.
Show that DS∈NPC. You may only assume that VC is known to be NP-Complete.