ConceptTheory & Algos
Handshaking lemma
A theorem stating that the sum of the degrees of all vertices in an undirected graph is equal to twice the number of edges.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
4The lectures that define it or assume it, and the concepts next to it.