We are given an undirected, unweighted graph and a non-negative integer K.
- We have to choose at least K vertices of the input graph, such that none of the selected vertices are neighbours in the graph