But if when the number of vertices given is 2 then the number of edges will be ???

The Gateway to Computer Science Excellence

+23 votes

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

- $n-1$
- $n$
- $n+1$
- None of the above

52,218 questions

59,876 answers

201,074 comments

118,121 users