A subset of the nodes of a graph G is a dominating set if every other node

Question:

A subset of the nodes of a graph G is a dominating set if every other node of G is adjacent to some node in the subset. Let

DOMINATING-SET = {〈G, k〉| G has a dominating set with k nodes}.

Show that it is NP-complete by giving a reduction from VERTEX-COVER.

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: