655 views
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 ____________________.

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
1
9 votes
9 votes
1 answer
2
firki lama asked Jan 16, 2017
3,478 views
A complete graph G with 5 nodes has positive weight edges,each edge has a distinct weight with an integer value and maximum weight is equal to number of edges in G.What c...
1 votes
1 votes
1 answer
3
radha gogia asked Feb 20, 2016
387 views
I tried by taking n=2 , and took points (1,1) ,(1,2) ,(2,2),(2,1) and I got the minimum weight to be 3 , which is n+1 but according to answer it is n-1