Let 𝐺(𝑉,𝐸) be a simple, undirected graph. A vertex cover of 𝐺 is a subset…

GATE Β· 2026 Β· CS Β· Set 1 Β· Computer Science & IT

Let 𝐺(𝑉,𝐸) be a simple, undirected graph. A vertex cover of 𝐺 is a subset Vβ€²βŠ†π‘‰ 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 π‘£βˆˆπ‘† ?

  1. A.

    The degree of 𝑣 is at least π‘˜+1

  2. B.

    The vertex 𝑣 is on a path of length π‘˜+1

  3. C.

    The vertex 𝑣 is on a cycle of length π‘˜+1

  4. D.

    The vertex 𝑣 is a part of a clique of size π‘˜

Attempted by 66 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…