given in the question always ;

So what if n=4 and m=4 connected graph.??

So what if n=4 and m=4 connected graph.??

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?

0

yeah given "always" so even if there is one example which contradicts the given answer,that is not gonna be correct

0

- Let we need to remove x edges from n(n-1)/2.
- A graph is necessarily be disconnected if it has (n-1)(n-2)/2.
- n(n-1)/2 - x = (n-1)(n-2)/2
- => x = n-1. Therefore answer is c.

0

circuit rank =e-n+1 gives number of edges to make spanning tree ... if we remove one more edge graph will be disconnected...inplace of e-n they have done e-n+2...

0

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

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