Let G be an undirected connected graph with distinct edge weights, i.e. no two edges have the same weight, emax be the edge with maximum weight and e min the edge with
minimum weight.

Which of the following statements is false?

Question

Let  G  be an undirected connected graph with distinct edge weights, i.e. no two edges have the same weight,   emax  be the edge with maximum weight and  e min  the edge with 
minimum weight.

Which of the following statements is false?

Answer

G  has a unique minimum spanning tree.

Answer

If the edge with weight  e max  is in a minimum spanning tree, then its removal must disconnect  G .

Answer

Every minimum spanning tree of  G  must contain the edge with weight  e min .

Answer

No minimum spanning tree contains the edge with weight  e max .

Crowdly

Let G be an undirected connected graph with distinct edge weights, i.e. no tw...

Want instant access to all verified answers on moodle.gla.ac.uk?