The minimum number of edges in a connected cyclic graph on $n$ vertices is:
(b). For making a cyclic graph, the minimum number of edges have to be equal to the number of vertices.
answer we be "n" because if you add a single edge also in spanning tree it will make a cycle .
spanning tree needs n-1 edges, so to make cycle it must have "(n-1)+1 edges . so option B is correct
Can someone help me understand examples on...