• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

Algorithms | Graph Minimum Spanning Tree | Question 7

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? (GATE CS 2000)


Every minimum spanning tree of G must contain emin


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


No minimum spanning tree contains emax


G has a unique minimum spanning tree


Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated :
Share your thoughts in the comments