Question Details

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?

Options

A

The degree of v is at least k +1

B

The vertex v is on a path of length k +1

C

The vertex v is on a cycle of length k +1

D

The vertex v is a part of a clique of size k

Show Answer
Correct Answer
A The degree of v is at least k +1

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 v must be in any vertex cover S of the minimum size k.

By definition, a vertex cover S of a graph G=(V,E) is a subset of vertices such that every edge in the graph has at least one of its endpoints in S.
Here, we are given that the size of the smallest vertex cover is k, and S is any vertex cover of size k, so |S|=k.

Let the degree of a vertex v be denoted by deg(v). The degree of v is the number of edges incident to v.
Suppose that deg(v)≥k+1. This means there are at least k+1 distinct edges incident to v, say (v,u1),(v,u2),...,(v,ud) where d≥k+1 and u1,u2,...,ud are distinct neighbors of v.

We want to prove that v must belong to S. Let us prove this by contradiction.
Assume for contradiction that v∉S.

Since S is a valid vertex cover, it must cover all the edges incident to v. That is, for every edge (v,ui) for i=1,2,...,d, at least one endpoint of the edge must be in S.
Because we assumed v∉S, the other endpoint ui must be in S for every i=1,2,...,d to cover each of these incident edges.

Therefore, we must have:
{u1,u2,...,ud}⊆S
Since all ui are distinct, the size of the vertex cover S must satisfy:
|S|≥d
Substituting d≥k+1, we get:
|S|≥k+1
But this contradicts our initial fact that the size of S is k (|S|=k).

Since the assumption v∉S leads to a contradiction, the vertex v must be in S.
Thus, if the degree of v is at least k+1, v is guaranteed to be in any vertex cover of size k.

Transparent Access on Mindyard

Built for Learners & Educators Alike

Completely free for students. Educators & coaching institutes get 2 months free Pro trial to create tests.

FREE FOR STUDENTS

Practice & Learn Free for Students

Access unlimited practice questions, detailed step-by-step solutions, and exam study materials — completely free for students.

  • Unlimited mock tests & question bank practice
  • Full access to curated study library & formula notes
  • 100% free for students • No credit card required
2 MONTHS FREE TRIAL

Educators & Coaching Institutes

Create and conduct professional online assessments with AI question generation, tab proctoring, and comprehensive batch management.

  • AI question uploader & rapid test generator
  • Anti-cheating tab proctoring & performance reports
  • Full Pro access free for 60 days • No upfront commitment
Discover more resources

You may also like

Mock Tests

View All
  • GATE
  • beginner
  • 3 hours
  • civil engineering

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.

  • GATE
  • beginner
  • 3 hours
  • electronics and communication engineering

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.

Ask AI Tutor
5 left
Q1 View Question & Options
AI Tutor is solving this question...
Reading question context & options...
Ask your own doubt or choose a quick prompt: