CameraIcon
CameraIcon
SearchIcon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

Let w be the minimum weight among all edge weights in an undirected connected graph. Let e be a specific edge of weight w. Which of the following is FALSE?


A
If e is not in a minimum spanning tree T, then in the cycle formed by adding e to T, all edges have the same weight
No worries! We‘ve got your back. Try BYJU‘S free classes today!
B
Every minimum spanning tree has an edge of weight w
No worries! We‘ve got your back. Try BYJU‘S free classes today!
C
e is present in every minimum spanning tree
Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses
D
There is a minimum spanning tree containing e
No worries! We‘ve got your back. Try BYJU‘S free classes today!
Open in App
Solution

The correct option is C e is present in every minimum spanning tree
W be the minimum weight among all edge weigts in an undirected connected graph.

e is the specific edge of weight w. It may be possible that another edge in the graph having weight w which had been added to minimum spanning tree and when we add e to minimum spanning tree it form a simple circuit.

So we can't include e in every minimum spanning tree.

flag
Suggest Corrections
thumbs-up
0
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Shapes of Orbitals and Nodes
CHEMISTRY
Watch in App
Join BYJU'S Learning Program
CrossIcon