• MINIMUM VERTEX COVER OF DIFFERENT REGULAR PLANAR GRAPHS AND ITS APPLICATION
Abstract
The Minimum vertex cover of a class of Regular Planar Sub-Graph H(2m+2,3m+3), K(2m+2,4m+4) for m≥2 and J(2m+2,5m+5) for m≥5 obtained from the complete graph K2m+2 have been discussed. In addition to this, to find the minimum vertex cover of any graph an algorithm has been developed. Finally an application of minimum vertex cover has been focused.
Keywords
Vertex Cover, Complete Graph, Planar Graph, Regular Graph, Algorithm.
Full Text:
pdf
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
| © 2010-2022 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |