MA415 HOMEWORK #6
Due Friday, April 7

1. Section 6,2, #6, 10, 11, 16.
2. Use the Matrix Tree Theorem to prove that the complete graph on n vertices has exactly spanning trees.

• About this document ...