Testbook

Question

I am not getting how statement 3 is false and statement 4 is true.

Statement 3: If the weights are unique, ho can there be multiple second best spanning trees?

Statement 4: If the graph is triangle, wont there be any spanning tree?

Comments

iv) says if graph G contains any edges which doesnt belong to any cycle, then all of them will definitely be present in minimum spanning tree.

in a triangle there will be no edge which doesnt belong to a cycle.. so that is not a good graph to check correctness of the statement
take a line graph.. 8 edges and 9 vertices. all these 8 edges will be deinitely present in minimum spanning tree.
to disprove the statement, prove that Given graph G contains an edge which doesnt belong to any cycle and that is not included in spanning tree.

i think u are reading the sentence in some other way

---

ok, i misread statement 4.

What about statement 3?

---

This question is asked 3 rd time today itself. and I think 1,2,3 are correct.

---

ohh...sorry. I will check for already asked question

Answer 1

In the graph, the best MST consists of edges of weights 2, 3, 5.

There are two 2nd-best MSTs, one having edges of weights 2, 4, 5 and

the other one having edges of weights 2, 3, 6

Comments

Thanks