retagged by
640 views
0 votes
0 votes

If the edge weight of minimum spanning tree are given and edge weight of each edge is distinct, then the minimum value of sum (abcdefg) is __________.

retagged by

1 Answer

Best answer
5 votes
5 votes
$a>10$ $11$
$b>7$ $8$
$c>5$ $9$
$d>7$ Because of e $12$
$e>7$ $13$
$f>10$ Because of g $14$
$g>10$ $15$

                                                                                                        $Sum =82$
 


Note: Weights are assigned this way because of 2 reasons :

  • Upper bound because of minimum is asked
  • Edges weight need to be distinct in this graph
selected by

Related questions

0 votes
0 votes
1 answer
1
Lakshman Bhaiya asked Nov 8, 2018
1,075 views
How many numbers of spanning tree are possible?
0 votes
0 votes
3 answers
3
iarnav asked Apr 29, 2018
1,573 views
Question 1) The shortest-path tree computed by Dijkstra's algorithm is necessarily an MST?Question2 ) Prim's algorithm works with negative weighted edges?
0 votes
0 votes
2 answers
4
iarnav asked Apr 28, 2018
395 views
Let G be a connected simple graph with non distinct edge weights. Now, e be the lightest edge in G. So, does this edge e is present in every MST of G?My take - when all e...