+23 votes
6k 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 | 6k views
0
But if  when the number of vertices given is 2 then the number of edges will be ???

## 3 Answers

+31 votes
Best answer

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

by Boss
edited by
+11 votes

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

by Active
+4 votes
Ans: B

eg. triangle, square etc.
by Loyal
Answer:

+31 votes
5 answers
1
+16 votes
2 answers
3
+2 votes
1 answer
4