The maximum degree of a vertex in G is?

The 2n2n  vertices of a graph G corresponds to all subsets of a set of size nn, for n≥6n≥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:

  1. (n/22)2n/2(n/22)2n/2
  2. 2n−22n−2
  3. 2n−3×32n−3×3
  4. 2n−1
1Comment
shivani @shivani1234
27 Jul 2017 05:39 pm

please rectify your question.