Q. 56 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:
