GATE CSE · 2026 · CS
Question 47: Algorithms
Give it a try, then reveal the answer to check your work.
Question 47
CSMSQ2 marksNeeds review
Let
be a simple, undirected graph. A vertex cover of
is a subset
such that for every
,
or
. Let the size of the smallest vertex cover in
be
. Let
be any vertex cover of size
.For a vertex
, which of the following constraints will always ensure that
?Your answerSelect all correct options. You can choose more than one.
Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerEXPLORE & PRACTISE
Paper and topic context
See where this question comes from and choose what to practise next.
2026CS
GATE CSE 2026 · Paper 1
Computer Science and Information Technology · Original paper archive
- Section
- Computer Science and Information Technology
- Question type
- Multiple select (MSQ)
- Marks
- 2 marks
Practise related topics
Explore more previous year questions using this question’s imported topic tags.
computer science
GATE CSE previous year questions
information technology
GATE CSE previous year questions
computing
GATE CSE previous year questions
algorithms
GATE CSE previous year questions
Comments
Ask a question, share your approach, or help someone understand.
Log in to view the discussion
You’re not logged in. Log in or create an account to see discussions and add comments.