222k views
4 votes
Prove that any minimum spanning tree t of g is also a bottleneck spanning tree of g.

User Hathor
by
5.7k points

2 Answers

6 votes

Answer:

Explanation:

can you explain a little bit more ?

User Gleb Belyaev
by
6.8k points
4 votes
I don’t know what if I wanna do you want me to come help
User BlueWanderer
by
6.0k points
Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.