## Discussion Forum

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

a. | Every minimum spanning tree of G must contain emin |

b. | If emax is in a minimum spanning tree, then its removal must disconnect G |

c. | No minimum spanning tree contains emax |

d. | G has a unique minimum spanning tree |

Answer:No minimum spanning tree contains emax |