Graph Theory · Algebra & Patterning
Graphs, Degrees, and Connectivity
The handshaking lemma — sum of degrees equals twice the number of edges — immediately implies every graph has an even number of odd-degree vertices.
WHAT STUDENTS WILL LEARN
✓Define graphs and digraphs
✓Apply the handshaking lemma: Σdeg(v) = 2|E|
✓Determine connectivity and cut vertices
✓Classify: bipartite, regular, complete, planar
COURSE OUTLINE · CLICK A PART FOR RESOURCES