DT Q19

Home
DT Q19

0. Let G be an undirected connected graph with distinct edge weights. Let e_max be the edge with maximum weight and e_min the edge with minimum weight. Which of the following statements is false?

Answer
Comment
Array

Option : C
Explanation :
If e_max is maximum weight edge in graph, them it is possible that e_max contain’s in minimum spanning tree.
Example

cd is maximum weight edge and it must present in minimum spanning tree

You must be logged in to post a comment.

You must be logged in to post a comment.

Forgot your password?

I agree with the Terms.