## 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 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. |