0 votes 0 votes 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? Graph Theory made-easy-test-series engineering-mathematics discrete-mathematics graph-theory graph-connectivity + – Anusha Motamarri asked Dec 8, 2016 recategorized Mar 4, 2019 by akash.dinkar12 Anusha Motamarri 818 views answer comment Share Follow See all 16 Comments See all 16 16 Comments reply Show 13 previous comments Anusha Motamarri commented Dec 8, 2016 reply Follow Share n refers to edges @gabbar. in ur case n refers to vertices 0 votes 0 votes Kapil commented Dec 8, 2016 reply Follow Share 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 0 votes 0 votes Anusha Motamarri commented Dec 8, 2016 reply Follow Share we already know ME is famous for its mistakes ;) 2 votes 2 votes Please log in or register to add a comment.