Algorithms Graphs/Spanning Tree and Shortest Paths Spanning Tree

Let G be an undirected connected graph with distinct edge weight. Let W be the edge with maximum weight and E be the edge with minimum weight.Which of the following statement is False? 

1
If W is in a minimum spanning tree,then its removal must disconnect G
2
No minimum spanning tree contains W
3
Every minimum spanning tree of G must contain at least 1 edge with edge weight E. 
4
G has a unique minimum spanning tree

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Other Tools: chatwiz.hivanix.in mmspace.hivanix.in unogame.hivanix.in

Quick Navigation

Home

Subjects

Chapters