Indian Journal of Science and Technology
Year: 2016, Volume: 9, Issue: 37, Pages: 1-7
Atowar-ul Islam1*, Jayanta Kr Choudhury2 and Bichitra Kalita3
1 Department of Computer Science and IT, Cotton College, Guwahati - 781001, Assam, India; [email protected]
2 Department of Mathematics, Swadeshi College of Commerce, Guwahati - 781007, Assam, India; [email protected]
3 Department of Computer Application (MCA), Assam Engineering College, Guwahati - 781013, Assam, India; [email protected]
*Author for correspondence
Department of Computer Science and IT
Email: [email protected]
Objective: The Minimum Vertex Cover of a circulant graph for m≥2 obtained from the complete graph K2m+1 and K2m+2 have been discussed. Methods: Minimum Vertex Cover is a NP Complete problem. Various properties to find out the Minimum Vertex Cover of different types of circulant graphs of even and odd values of m≥2 have been studied. Findings: After studied the Minimum vertex cover we find two theorems for the graph K2m+1 and K2m+2 and results are also observed. An algorithm also developed to find the Minimum Vertex Cover. Application: An application of minimum vertex cover has been cited to avoid the deadlock condition in process graph with an example.
Keywords: Circulant Graph, Complete Graph, Deadlock, Minimum Vertex Cover, Process, Resources
Subscribe now for latest articles and news.