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

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 maximum degree of a vertex in G is:

(n/2)C2 *2n/2

2n-2

2n-3 *3

2n-1

Share your thoughts in the comments