Handshaking Lemma in Graph Theory

Sometimes called the first theorem of graph theory, the handshaking lemma consists of a main lemma and a consequent corollary. The first part tell us that in a finite, simple graph the sum of the degrees of the vertices equals two times the total number of edges. The second part tells us that the number of people at a party who shook hands with an odd number of people is even.