Multiple Choice
An MST of a graph G is always unique.
False. This is only true when the edge weights of G are distinct. Otherwise, consider a complete graph with all edges having equal weights. This graph obviously does not have a unique MST.
Which of following statements must be true about an MST of a connected graph G with distinct edge weights: