This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: ) 7. Use Kruskals algorithm to nd all least weight spanning trees for this 4 1 5 3 5 3 4 2 6 weighted graph. 8. Find a minimum cost spanning tree for the graph with this cost matrix. How many such trees are there? A B C D E F G H A 12 14 11 17 8 B 12 9 12 15 10 9 C 9 18 14 31 9 D 14 18 6 23 14 E 11 12 14 15 16 F 15 31 6 15 8 16 G 17 10 23 16 8 22 H 8 9 9 14 16 22 Extra questions 9. Find a minimum weight spanning tree in each of the following weighted graphs: ( i ) 3 4 1 2 6 6 5 7 ( ii ) 7 6 7 9 9 5 6 9 7 8 10. Use the Matrix Tree Theorem to verify the fact that the number of spanning trees of the complete graph K n is equal to the number of labelled trees on n vertices....
View
Full
Document
 Spring '09
 Math, Graph Theory

Click to edit the document details