minimum spanning tree

Question

A complete graph G with 5 nodes has positive weight edge ,each node has distinct weight with an integer value and maximum weight is equal to the number of edges in G.What can  be the maximum weight of minimum spanning tree for  graph G?

Comments

Yes ! Corrected !

---

answer given 14

---

Answer should be 14.

Answer 1

total no of nodes = 5 then total no. of edges will be n(n-1)/2 =10

as given in question max weight will be 10.

hence, max weight of spanning tree will be 14.

Comments

can we give 1 to 10 numbers to any of the edges ?

if yes then we can get 13 or 15 and so on as answers right ?

---

yes, we can give randomly 1 to 10 but the resulting spanning tree must give max edge weights thats our main goal.