Test Series

Question

I think answer should be (A).

Because when we consider simple grpah means no cycle and thud (n-1) edges will connect all components(vertices) hence graph will always be connected.

Comments

Simple graph does not mean that there is no cycle. 
According to Wiki

A simple graph is an undirected graph in which both multiple edges and loops are disallowed. In a simple graph the edges form a set (rather than a multiset) and each edge is an unordered pair of distinct vertices. Thus, we can define a simple graph to be a set V of vertices together with a subset E of the set of 2-element subsets of V.

In a simple graph with n vertices, the degree of every vertex is at most n − 1.