## Handshaking Lemma and Trees

Handshaking Lemma and Trees What is Handshaking Lemma? Degree of a vertex is number of edges incident on it. Handshaking Lemma states that, in every finite undirected graph, number of vertices with odd degree is always even. The handshaking lemma is a consequence of the degree sum formula: The vertices of odd degree in a… Read More »