Let G be a weighted undirected graph and e be an edge with maximum weight in G.Suppose there is a minimum weight spanning tree in G containing the edge e.Which of the following statements is always TRUE?
1.There exists a cut in g having all edges if maximum weight
2.There exists a cycle in G having all edges of maximum weight
3.Edge e can not be contained in a cycle
4.All edges in G have the same weight
i think Option 4 and 1 is correct but which is always true .and what is the meaning of option 3.Can any body remove my confusion ??