Due in class Monday, September 30.

1.3.3: #2, #4, #5 (on #5, you can assume that any m.w.s.t. comes from Kruskal’s algorithm.)

1.3.4: #1, #2, #3, #4, #5 (on #5, “distinct terms” means “no repeats”.)

And one more:

A. Let G be a 5-cycle with one more edge added between two of the vertices. Count the number of spanning trees of G by hand, and using Kirkhoff’s matrix tree theorem.

Extra credit: 1.3.3 #7, 1.3.4 #6