The minimum number of edges in a connected graph with ‘n’ vertices is equal to

2010

Answer: D. n − 1 — 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.

1. A.

   n(n − 1)

2. B.

   n(n − 1)/2

3. C.

   n²

4. D.

   n − 1

Attempted by 172 students.

A video solution is available for this question — log in and enroll to watch it.