leta connected graph G = (V,E) have distinct postitive weight edges & T be a spa

Question

leta connected graph G = (V,E) have distinct postitive weight edges & T be a spanning tree of G, unkown if it is a Minimum Spanning Tree. The dominant edge of T is the edge with the greatest weight. A spanning tree is said to be a minimax spanning tree if there is no other spanning tree with a lower-weight dominant edge. In other words, a minimax tree minimizes the weight of the heaviest edge (instead of minimizing the overall sum of edge weights). Is every Minimum Spanning Tree of G also a minmax spanning tree of G, and is every min max spanning tree of G also a mininum spanning tree of G?

Explanation / Answer

Solution:

Well, every minimum spanning tree can be a minimax spanning tree, and it is two way, which means both the statements are correct.

let me tell you why?

I hope this helps if you find any problem. Please comment below. Don't forget to give a thumbs up if you liked it. :)

Related Questions

Navigate

• Browse (All)
• Browse L
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.