Minimum Vertex Cover of a New Cluster Graph and its Application in Sensor Network

Abstract

In this paper we have introduce a new cluster graph G(2n+6, 3n+m) and construct the graph as 4 regular graph. We have find minimum vertex cover of the graph G(2n+6, 3n+m). An algorithm has been developed to find the minimum vertex cover of any graph. In addition to this a theorem also developed. Finally an application of minimum vertex cover has been focused on sensor network.