Compute the number of spanning trees of Km,n. Using  the matrix tree theorem

5) Find the minimum spanning tree of the following graph using Kruskal's algorithm. All steps of the solution are written in the details. 8 4 2 2 7 6 8 h 7 10 2

-In what order are the four edges added when finding the spanning tree with Prim's algorithm? In what order are the four edges added when finding the spanning tree with Kruskal's algorithm?

9. Use Prim's algorithm to find a minimal spanning tree for the weighted graph in the following figure. Use A as the initial vertex and list the edges in the order in which they are chosen, and give the diagraph of the tree... (7) B - 3 0 لا 2 3 2 - 4 E