Skip to content
Related Articles

Related Articles

GATE | GATE-CS-2006 | Question 72

Improve Article
Save Article
Like Article
  • 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 maximum degree of a vertex in G is:
(A) (n/2)C2 *2n/2
(B) 2n-2
(C) 2n-3 *3
(D) 2n-1

Answer: (C)

Explanation: maxk(kC2*2(n−k))=3C2*2(n−3)=3*2(n−3).

Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!