can option c also be false,here in the question it is not mentioned that graph has distinct weight so if all have same weight then there may be chance that option c might be false?plsss clarify?
Let w be the minimum weight among all edge weights in an undirected connected graph. Let e be a specific edge of weight w. Which of the following is FALSE?
-
There is a minimum spanning tree containing e
-
If e is not in a minimum spanning tree T, then in the cycle formed by adding e to T, all edges have the same weight.
-
Every minimum spanning tree has an edge of weight w
-
e is present in every minimum spanning tree
