The Connected Vertex Cover in Graphs

This paper presents tight bounds and characterizations for the vertex cover number and the connected vertex cover number of graphs. In particular, we identify all graphs for which βc(G) = |V (G)| − 1, proving that these are exactly the cycles and complete graphs. The analysis employs tools such as the degree matrix and the Rayleigh quotient to derive new and sharp upper bounds.