GATE 2000

Question 41

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?

A
Every minimum spanning tree of G must contain emin
B
If emax is in a minimum spanning tree, then its removal must disconnect G
C
No minimum spanning tree contains emax
D
G has a unique minimum spanning tree
AlgorithmsMinimum-Spanning-Tree
Question 41 Explanation: 

Minimum Spanning Tree:
Correct Answer: C
Question 41 Explanation: 

Minimum Spanning Tree:

Related posts

April 14, 2025

NTA UGC NET Aug 2024 Paper-2

Read more

Leave a Reply

Your email address will not be published. Required fields are marked *

error: <b>Alert: </b>Content selection is disabled!!
GATE 2001
February 13, 2024
Question 10740 – Minimum-Spanning-Tree
February 13, 2024
GATE 2001
February 13, 2024
Question 10740 – Minimum-Spanning-Tree
February 13, 2024