Your Section 6.1 homework is graded. I graded three problems. Once
again I avoided too many comments on your homeworks. Please
just see the "key" that I've posted with them:
This one is simple enough... that's
a joke. But it's also true! Emphasize symmetry
when you draw these.
Interesting little puzzle, built
on Euler's formula for planar graphs. The point
to emphasize is that every arc contributes two
to the total degree, so you can get the number
of arcs by dividing total degree by 2.
It's easy to go back and forth
between an adjacency matrix and the graph. You
could check the total degree remark on this
one: Total degree is just the sum of all the
entries in the matrix. How many arcs did you draw?
For section 6.2, I'm grading 12, 30, and 55; but I haven't finished grading....
I created a wiki account for everyone last week (who didn't
already have one). The invitations are generally flagged by
NKU's email server and sent off to spam; you may find the
invite on webmail.nku.edu,
in the quarantine.
If you have any trouble let me know -- maybe you'll even visit
during office hours!
Today: Section 7.2 Euler Path and Hamiltonian Circuit
We look at a couple of graph algorithms. Many of you will have seen
these before, so you'll be in comfortable territory.