The 2^n 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 connected components in G is
The answer is (n + 2) because there are (n + 1) isolated vertex and 1 connected component of remaining vertices.
Component and Connected Component is one and the same thing right?