The minimum number of edges in a connected graph with ‘n’ vertices is equal to
2010
The minimum number of edges in a connected graph with ‘n’ vertices is equal to
- A.
n(n − 1)
- B.
n(n − 1)/2
- C.
n²
- D.
n − 1
Attempted by 79 students.
Show answer & explanation
Correct answer: D
To connect n vertices, a graph requires at least n minus 1 edges. This forms a tree structure where every vertex is reachable from any other without cycles.
A video solution is available for this question — log in and enroll to watch it.