Let G be a simple, undirected graph with n (n>10) vertices and k connected…
PYQ UGC NET 2022
Let G be a simple, undirected graph with n (n>10) vertices and k connected components. What is the minimum possible number of edges of G?
- A.
k(n-1)
- B.
n(k-1)
- C.
n+k-2
- D.
n-k
Attempted by 25 students.
Sign up free to check your answer
Sign up freeLoading lesson…

