The minimum number of edges in a connected cyclic graph on n vertices is:
GATE · 1995 · CS · Question 1 subparts
The minimum number of edges in a connected cyclic graph on n vertices is:
- A.
n − 1
- B.
n
- C.
n + 1
- D.
None of the above
Attempted by 44 students.
Sign up free to check your answer
Sign up freeLoading lesson…