What Is Minimum Bottleneck Spanning Tree?

In mathematics, a minimum bottleneck spanning tree (MBST) in an undirected graph is a spanning tree in which the most expensive edge is as cheap as possible. ... A spanning tree is a minimum bottleneck spanning tree if the graph does not contain a spanning tree with a smaller bottleneck edge weight.

Is every minimum spanning tree a minimum bottleneck tree?

Since all the spanning trees have the same value for the bottleneck edge, all the spanning trees are Minimum Bottleneck Spanning Trees for the given graph. But, all are not minimum spanning trees, since the overall weight is minimum(8) only for the two of the spanning trees.

What is meant by minimum spanning tree?

The Minimum Spanning Tree is the one whose cumulative edge weights have the smallest value, however. Think of it as the least cost path that goes through the entire graph and touches every vertex.