MadeEasy Test Series: Graph Theory - Graph Connectivity

Question

if m=4
and n=6 (complete graph)
option B says removal of mC2-n+2 = 6-6+2=2 edges.
but it needs 3 edges to make the graph disconnected. how B is answer?

Comments

n refers to edges @gabbar. in ur case n refers to vertices

---

Actually to make something connected, it should have more than $\frac{(n-1)(n-2)}{2}$ edges, i.e, just add one more edge. This gives $\frac{n^{2} - 3n + 4}{2}$ edges

Now here in 2nd option,

$C(m,2) -m + 2$ (n is replaced by m)

This also gives $\frac{n^{2} - 3n + 4}{2}$ edges.

Now, I am not getting the options :P

---

we already know ME is famous for its mistakes ;)