0 votes 0 votes Let us assume that $G$($V$, $E$) is a weighted complete graph such that weight of the edge <$V_K$,$V_L$>=2|$K$-$L$|. The weight MST of $G$ with 100 vertices is ____________________. Algorithms algorithms minimum-spanning-tree + – Naveen Kumar 3 asked Nov 10, 2018 Naveen Kumar 3 655 views answer comment Share Follow See all 7 Comments See all 7 7 Comments reply Show 4 previous comments Naveen Kumar 3 commented Nov 10, 2018 reply Follow Share like this one?? 0 votes 0 votes adarsh_1997 commented Nov 10, 2018 reply Follow Share yes your n=4 diagram is correct use that example. correct your n=3 diagram(edges b/w 1-3 must be 4) 0 votes 0 votes Naveen Kumar 3 commented Nov 10, 2018 reply Follow Share yes... thanks, got it! 0 votes 0 votes Please log in or register to add a comment.