• edited by
39,656 views
154 154 votes

$G=(V, E)$ is an undirected simple graph in which each edge has a distinct weight, and $e$ is a particular edge of $G$. Which of the following statements about the minimum spanning trees $(MSTs)$ of $G$ is/are TRUE?

  1. If $e$ is the lightest edge of some cycle in $G$, then every MST of $G$ includes $e$.
  2. If $e$ is the heaviest edge of some cycle in $G$, then every MST of $G$ excludes $e$.
  1. I only.
  2. II only.
  3. Both I and II.
  4. Neither I nor II.

9 Answers

0 0 votes
I think answer is D.

Statement I is wrong.

Statement II is also wrong, consider any graph where between any two nodes there are two paths, first path consists of edges with weights 2 and 8, second path has weight 5 and 7. So, MST would include that heaviest weight in that cycle.
0 0 votes

here it is given that all edges have distinct value. so by any algo prims or kruskal we are going to add e if it is lightest edge.

So first statement is always true

and 2nd statement is also true becouse we will always exclue one with the heaviest wieght

0 0 votes

if for the same question the options were given like :-

  1. If e is the lightest edge  in G, then every MST of G includes e.
  2. If e is the heaviest edge in G, then every MST of G excludes e.

then option 1 would have been true while option 2 would be false coz what if the edge e is a brigde then we have to take it in MST.

but as cycle is there,so 

it might be the case that for one cycle it is the lightest but for another cycle heaviest so we cant take it .

 

Answer:
Position:
Show:

Related questions

118 118 votes
22 answers 22 answers
56.7k
56.7k views
Sandeep Singh asked Feb 12, 2016
56,717 views
Let $G$ be a complete undirected graph on $4$ vertices, having $6$ edges with weights being $1, 2, 3, 4, 5,$ and $6$. The maximum possible weight that a minimum weight s...
91 91 votes
9 answers 9 answers
38.4k
38.4k views
Sandeep Singh asked Feb 12, 2016
38,374 views
Let $G$ be a weighted connected undirected graph with distinct positive edge weights. If every edge weight is increased by the same value, then which of the following sta...
91 91 votes
11 answers 11 answers
45.2k
45.2k views
Sandeep Singh asked Feb 12, 2016
45,224 views
Consider the following directed graph:The number of different topological orderings of the vertices of the graph is _____________.
67 67 votes
6 answers 6 answers
28.4k
28.4k views
Sandeep Singh asked Feb 12, 2016
28,357 views
Consider the transition diagram of a PDA given below with input alphabet $\Sigma=\{a,b\}$ and stack alphabet $\Gamma = \{X,Z\}$. $Z$ is the initial stack symbol. Let $L$ ...