Home Work 5

CSCI 6339, Fall 2019

First name: Md Rysul, Last name: Kabir

Problem 1: Let MAX-CLIQUE = {<G, k> | the largest clique of G has k vertices}. Whether
MAX-CLIQUE is in NP is unknown. Show that if P = NP, then MAX-CLIQUE is in P, and a
polynomial time algorithm exists that, for graph G, finds one of its largest cliques.
Soln.

Problem 2: A subset of nodes of a graph G is a dominate set if every other node of G is a

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.
Soln.