Let G(V,E) be a simple, undirected graph. A vertex cover of G is a subset V′ ⊆ V such that for every (u,v) ∈ E, u ∈ V′ or v ∈ V′. Let the size of the smallest vertex cover in G be k. Let S be any vertex cover of size k. For a vertex v ∈ V, which of the following constraints will always ensure that v ∈ S?
Solution :
The correct option is: The degree of v is at least k + 1.
Let us understand why this constraint always ensures that the vertex must be in any vertex cover of the minimum size .
By definition, a vertex cover of a graph is a subset of vertices such that every edge in the graph has at least one of its endpoints in .
Here, we are given that the size of the smallest vertex cover is , and is any vertex cover of size , so .
Let the degree of a vertex be denoted by . The degree of is the number of edges incident to .
Suppose that . This means there are at least distinct edges incident to , say where and are distinct neighbors of .
We want to prove that must belong to . Let us prove this by contradiction.
Assume for contradiction that .
Since is a valid vertex cover, it must cover all the edges incident to . That is, for every edge for , at least one endpoint of the edge must be in .
Because we assumed , the other endpoint must be in for every to cover each of these incident edges.
Therefore, we must have:
Since all are distinct, the size of the vertex cover must satisfy:
Substituting , we get:
But this contradicts our initial fact that the size of is ().
Since the assumption leads to a contradiction, the vertex must be in .
Thus, if the degree of is at least , is guaranteed to be in any vertex cover of size .
Completely free for students. Educators & coaching institutes get 2 months free Pro trial to create tests.
Access unlimited practice questions, detailed step-by-step solutions, and exam study materials — completely free for students.
Create and conduct professional online assessments with AI question generation, tab proctoring, and comprehensive batch management.
Prepare for GATE 2026 Civil Engineering with the latest question papers, previous year papers, detailed solutions, syllabus, exam pattern, preparation tips, mock tests, and subject-wise study material. Download GATE 2026 CE question papers with solutions in PDF format and boost your preparation for top engineering institutes and PSU recruitment.
Prepare effectively for GATE 2026 Electronics & Communication Engineering (EC) with this comprehensive Question Paper with Solutions. This resource includes detailed explanations, concept-wise solutions, previous year paper analysis, and exam-oriented practice to help aspirants strengthen core subjects like Electronic Devices, Analog Circuits, Digital Circuits, Signals & Systems, Network Theory, Control Systems, Electromagnetics, Communications, and more. Perfect for revision, self-assessment, and boosting your GATE 2026 EC preparation strategy.
Copyright © 2026 Combe Labs Private Limited. All Rights Reserved.