Problem
Properties of MST in a Undirected Graph
Easy
0/10
Problem statement
G = (V,E) is an undirected simple graph in which each edge has a distinct weight, and e is a particular edge of G. Which of the following statements about the minimum spanning trees (MSTs) of G is/are TRUE?
I. If e is the lightest edge of some cycle in G, then every MST of G includes e
II. If e is the heaviest edge of some cycle in G, then every MST of G excludes e
Properties of MST in a Undirected Graph
One or more answers may be correct
One or more answers may be correct