Question

2. Minimum and maximum spanning trees for the weighted Petersen graph. ei 4 (a) Find a minimum weighted spanning tree for the above weighted Petersen graph (b) Find a maximum weighted spanning tree for the above weighted Petersen graph

Answer 1

a)

a) Kruskal's Algorithm to find the Minimum Cost Spanning Tree (MCST) of a graph G as follows: Kruskal's Algorithm to find the Minimum Cost Spanning Tree (MCST) of a graph G as follows: For n - Vertices we get (n - 1) Edges in MCST. Here in graph having 10 Vertices so we get 9 Edges Which is Required MCST of a graph b) Kruskal's Algorithm to find the Maximum Cost Spanning Tree (MCST) of a graph G as follows: Kruskal's Algorithm to find the Maximum Cost Spanning Tree (MCST) of a graph G as follows: For n - Vertices we get (n - 1) Edges in MCST. Here in graph having 10 Vertices so we get 9 Edges Which is Required Maximum Cost Spanning Tree of a graph

b)