info@avatto.com
+91-9920808017
0. Consider a weighted complete graph G on the vertex set {ν1, ν2, .... νn} such that the weight of the edge (νi, νj) is 4 | i – j|. The weight of minimum cost spanning tree of G is :
4n2
n
4n - 4
2n - 2
You must be logged in to post a comment.
Login with Facebook
Login with Google
Forgot your password?
Lost your password? Please enter your email address. You will receive mail with link to set new password.
Back to login
You must be logged in to post a comment.