📐 Handshaking Lemma
For any graph $G$, $\\sum_{v \\in V(G)} d(v) = 2|E(G)|$.
Proof: Each edge contributes exactly 2 to the sum of degrees (one for each endpoint).
From: Introduction to Graph Theory
Learn more: https://west-graphs-deploy.vercel.app/#/section/3
Explore all courses: https://mathacademy-cyan.vercel.app