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?

Question

Answer

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

Answer

G has a unique minimum spanning tree

Answer

No minimum spanning tree contains emax

Answer

Every minimum spanning tree of G must contain emin

Crowdly

Let G be an undirected connected graph with distinct edge weight. Let emax be th...

Want instant access to all verified answers on moovit.vit.ac.in?