Implementation of Minimum Vertex Cover in Circulant Graph having Hamiltonian path and its Application in Resource Allocation Process

The issue of Minimum Vertex Cover is NP Complete. We have presented two theorems in this book chapter, the first…