4.9k views

The minimum number of edges in a connected cyclic graph on $n$ vertices is:

1. $n-1$
2. $n$
3. $n+1$
4. None of the above
edited | 4.9k views

(b). For making a cyclic graph, the minimum number of edges have to be equal to the number of vertices.

edited by

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

Ans: B

eg. triangle, square etc.

1
2