Generally, a graph G, an independent set is a subset S of vertices in G such
that no two vertices in S are adjacent (connected by an edge) and a vertex
cover is a subset S of vertices such that each edge of G has at least one of
its endpoints in S. Again, the minimum vertex cover problem is to find a vertex
cover with the smallest number of vertices. This study shows that the
constrained minimum vertex cover problem in k-partite graph (MIN CVCK) is
NP-Complete which is an important property of k partite graph.