A weighted complete graph with n vertices has weights 2 |i -

Please wait...
THANKU FOR BEING A PART OF OUR JOURNEY TO BRING "REVOLUTION IN EDUCATION"
We Genuinely APPRECIATE your PATIENCE

Coming Soon

43

M: +2.00/-0.66

A weighted complete graph with n vertices has weights 2 |i - j| at edges (v_i, v_j) The weight of a minimum spanning tree is

[ESE (IES) EC 2017 Technical]

A n2/2

B n/2

C 2n - 2

D n - 1