Given an undirected graph G(V,E), find the minimum number of vertices to remove so that the Edge Set of the graph becomes $ \phi$ .

In other words: If we remove one vertex we remove that vertex along with all edges connected to that vertex. Find the minimum number of vertices to remove so that there are no edges left in G after their removal.