Question: The minimum spanning tree in the following graph is obtained by the Kruskal method. This graph has 6 nodes and 8 edges of a, b,
The minimum spanning tree in the following graph is obtained by the Kruskal method. This graph has 6 nodes and 8 edges of a, b, c, d, e, f, g, h, i.

1. Find out the number of nodes and the number of sides of the spanning tree
2. Then, illustrate the minimum spanning tree, assuming a, b, c, d, e, f, g, h, i when the sides are arranged in ascending order of weight and answer the branches used in just proportion.
3. Then, illustrate the minimum spanning tree, assuming a, c, g, b, d, f, e, h, i when the sides are arranged in ascending order of weight and answer the branches used in just proportion.
!!!Need process!!!
!!!2 and 3 are different!!!
d h C 8 f
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
