TestBook testseries question to find max weight of MST closed

Question

A complete graph G with 5 nodes has positive weight edges, each node has a distinct weight with an integer value and maximum weight is equal to number of edges in G.

What can be the maximum weight of minimum spanning tree for graph G?

Comments

Should i add what explanation is given?

---

yes 14 is correct .

 

This will be the graph .try finding mst here.

---

How this graph is made , could you explain a bit.

Answer 1

Complete graph → https://en.wikipedia.org/wiki/Complete_graph

Here just make a complete graph, and give every edge a distinct weight $(1- 10)$, 

maximum weight is equal to number of edges in G

as here no. of edges are 10 so the maximum weight is also 10. 

no. of edges in a complete graph  = $\frac{n(n-1)}{2}$ 

Now just use prims  or kruskals algorithm to find the MST.