Guichard-Combinatorics-Graph-Theory · Problem 5.6.2
Graph Theory
Mathematics — Probability · optimal-spanning-trees
Problem
Prove that if the edge costs of G are distinct, there is exactly one minimum cost spanning tree. Give an example of a graph G with more than one minimum cost spanning tree.