Minimum Vertex Cover Set for Generalized Petersen Graphs P( n,2)
Wei Zheng · Journal of Shanxi Normal University · 2014
Vertex Cover problem( VC) is a famous NP-complete problems. Nontrivial upper bounds and deriving lower bounds for the problem have excited a continuous interest for many years with computational methods and mathematical methods. In this paper,we study the upper bounds and lower bounds for the vertex cover number of generalized Petersen graph P( n,2) and obtain the exact value.