We propose the approaches that using the neighbour relation of nodes in the graph to solve the minimum vertex cover problem.