Skip to content
Related Articles

Related Articles

Improve Article
Save Article
Like Article

GATE | GATE-CS-2006 | Question 71

  • Difficulty Level : Hard
  • Last Updated : 07 Sep, 2018

The 2n vertices of a graph G corresponds to all subsets of a set of size n, for n >= 6 . Two vertices of G are adjacent if and only if the corresponding sets intersect in exactly two elements.

The number of vertices of degree zero in G is:
(A) 1
(B) n
(C) n+1
(D) 2n


Answer: (C)

Explanation: There are n nodes which are single and 1 node which belong to empty set. And since they are not having 2 or more elements so they won’t be connected to anyone hence total number of nodes with degree 0 are n+1.

Attention reader! Don’t stop learning now.  Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.

Learn all GATE CS concepts with Free Live Classes on our youtube channel.

Thanks to roger for the explanation.

Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :