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:
1
n
n+1
2n
This question is part of this quiz :
Top MCQs on Graph Theory in Mathematics,GATE-CS-2006,Topic Wise Quiz on Graph Theory,Discrete mathematics PYQ GATE QUIZ