Follow Us :

DT Q22

22Let 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?
  • Option : A
  • Explanation :
    Option A is correct, there exists a cut set in G having all edges of maximum weight
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *