The 2n vertices of a graph G corresponds to all subsets of a set of size n,…
PYQ GATE 2006
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
Attempted by 273 students.
Sign up free to check your answer
Sign up freeLoading lesson…

