Question: Given a graph G = ( V , E ) and a positive integer r , the dominating set problem ( DSP ) is to

Given a graph G =(V,E) and a positive integer r, the dominating set problem (DSP) is to decide if there is a subset B V of size r such that every vertex that is not in B, has an adjacent vertex in B. Prove that the vertex cover problem is polynomial time reducible to DSP.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!