GATE | CS |2006 | Discrete maths | Graph theory | Question 71

Last Updated :
Discuss
Comments

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

Share your thoughts in the comments