Definitions from Wikipedia (Handshaking lemma)

▸ noun:  In graph theory, the handshaking lemma is the statement that, in every finite undirected graph, the number of vertices that touch an odd number of edges is even.


▸ Words similar to Handshaking lemma
▸ Usage examples for Handshaking lemma

▸ Idioms related to Handshaking lemma
▸ Wikipedia articles (New!)
▸ Words that often appear near Handshaking lemma
▸ Rhymes of Handshaking lemma

▸ Invented words related to Handshaking lemma