Follow Us :

DT Q19

0. Let G be an undirected connected graph with distinct edge weights. Let emax be the edge with maximum weight and emin the edge with minimum weight. Which of the following statements is false?

  • Option : C
  • Explanation :
    If emax is maximum weight edge in graph, them it is possible that emax contain’s in minimum spanning tree.
    Example

    cd is maximum weight edge and it must present in minimum spanning tree
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 *