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. n2
D. n–1
Answer:D
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. n2 D. n–1