hI am in the same boat as you, user62562. I am now a bit more than half-way through my first time teaching this 10 week class now. I have 24 students. The most fun I had -and I think the class -- was (A) showing them the spectral algorithms underlying Google's PageRanker uses when we enter searchers following this 5 page article: http://www.ams.org/samplings/feature-column/fcarc-pagerank and (B) teaching them an amazing formula for the number of spanning trees in a connected graph. This number equals any one of the $n^2$ cofactors of that graph's Laplacian. See Biggs, Algebraic Graph Theory, Part 1, section 6.