3.1, due September 28

Difficult:
I thought the section was pretty simple, but I did think the proofs of propositions about graphs were a bit difficult, just because they prove things using patterns of logic that are less familiar.

Reflective:
I thought it was a pretty amazing result that by squaring the adjacency matrix you can find the number of paths from node i to node j. I don't understand how it works  (at least not until I prove it in the homework), but I think it is a pretty cool property.

Comments

Popular posts from this blog

8.7, due December 6

8.5, due Dec 3

8.6, due Dec 5