Draw the minimum cost spanning tree for the following graph using Kruskal’s algorithm

Now,

Step-1: We first select an edge with minimum weight.

Step-2: Then we select next minimum weighted edge. It is not necessary that selected edge is adjacent.

Step-3: Select next minimum weighted edge. It is not necessary that selected edge is adjacent.

Step-4: Select next minimum weighted edge.

Step-5: Select next minimum weighted edge.

Step-6: Select next minimum weighted edge.

Step-7: Make graph connected select the minimum weighted edge. Then we get a spanning.

 The minimum cost of spanning tree is 31.