## Discussion Forum

Que. | 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: |

a. | n |

b. | n+2 |

c. | 2^n/2 |

d. | 2^n / n |

Answer:n+2 |