1. Every minimum spanning tree of G must contain emin
  2. If  emax is in a minimum spanning tree, then its removal must be disconnected G.
  3. No minimum spanning tree contains emax
  4. G has a unique minimum spanning tree.
4 views

1 Answers

Option 3 : No minimum spanning tree contains emax

Concept:

A minimum spanning tree (MST) or minimum weight spanning tree is a subset of the edges(V – 1 ) of a connected, edge-weighted undirected graph G(V, E) that connects all the vertices together, without any cycles and with the minimum possible total edge weight.

Example:

It cannot always be the case that the edge with emax should not be present in MST.

[ alt="Gate CS Algorithms Chapter-5 Images-Q7" src="//storage.googleapis.com/tb-img/production/15/12/Gate%20CS_Algorithms_Chapter-5_Images-Q7.PNG" style="height:377px; width:257px">

emax is present in MST.

4 views

Related Questions