Consider a complete weighted undirected graph G(V, E), where V is the set of all vertices and E is the set of all edges in G. |V| and |E| are the number of vertices and number of edges respectively in G. Let weights of the edges in G are assigned from N (the set of natural numbers). Consider the cost of the minimum spanning tree (MST) of G is given as W.
Which of the following expressions gives the maximum weight of an edge in given MST of G can be assigned?
1.W - ( |V| - 2 )
2.W - ( |E| - 2 )
3.W - ( |E| - 1 )
4.W - ( |V| - 1 )
ans is 1 bt how?
