Implementation of Minimum Vertex Cover in Circulant Graph having Hamiltonian path and its Application in Resource Allocation Process | Chapter 05 | Research Developments in Science and Technology Vol. 6

 The issue of Minimum Vertex Cover is NP Complete. We have presented two theorems in this book chapter, the first of which explains the decomposition of complete graphs K2m+1 into circulant graph C 2m+1 (j) for m 2 where j is the jump, 1 j m into m edge disjoint circulant graphs, and the second of which explains the decomposition of complete graphs K2m+2 into circulant graph C2m+1(j) for m 2 where j is the jump The Minimum vertex cover of circualnt edge disjoint graphs K2m+1 and K2m+2 for m 2 has also been created, and the Minimum vertex cover approach has been employed to minimise deadlock in process synchronisation.

Author(S) Details

Atowar Ul Islam
Department of Computer Science & Electronics, University of Science and Technology Meghalaya, India.

Gautam Chakraborty
NERIM Group of Institutions, Guwahati, Assam, India.

Dipankar Dutta
NERIM Group of Institutions, Guwahati, Assam, India.

View Book:- https://stm.bookpi.org/RDST-V6/article/view/7011