retagged by
255 views

1 Answer

0 votes
0 votes
option b and option d are false...

option b :

assume a cycle with three edges ( e1, e2, e3 ) with same weights.. Then one minimum spanning tree can choose e1 and another one can choose e2 and another minimum spanning tree can choose e3 etc ( by this example you can conclude option a is right ).

 

option d :

assume a cycle with three edges ( e1, e2, e3 ) with e1 and e2 with same weights and e3 with the weight less than e1.. Then minimum spanning tree choose always e3 and ignoring e1 and e2 always... Therefore only one minimum spanning tree exist.

 

option e :

minimum spanning tree's may be different but cost of minimum spanning tree always unique

Related questions

0 votes
0 votes
1 answer
1
0 votes
0 votes
0 answers
3
Huzaifa0111 asked Aug 27, 2023
157 views
2 votes
2 votes
3 answers
4
Jyoti Kumari97 asked May 25, 2019
5,973 views
Question:$T(1)=1$$T(n) = 2 T(n - 1) + n$evaluates to?Can anyone solve it by substitution method?Given answer $T(n) = 2^{n+1} - (n+2)$How?