UGC NET CSE | December 2018 | Part 2 | Question: 12

Question

Consider the graph shown below:

Use Kruskal’s algorithm to find the minimum spanning tree of the graph. The weight of this minimum spanning  tree is

• A. $17$
• B. $14$
• C. $16$
• D. $13$

Comments

1+1+1+2+2+2+3+4 = 16

---

Noo brother

I got 1+1+1+2+2+2+3+4 =>16 with 8 edges(n-1)

---

add again @Hemanth_13

---

Its should be 16 :)

Answer 1

Final minimum spanning tree will look like $-$

So the weight is $1+1+1+2+2+2+3+4= 16$

((There are 2MSTs possible ))

Answer 2

Applying Kruskal's Algorithm the Weight of MST is 16