| 释义 |
handshaking lemma The result that, in any graph, the sum of the degrees of all the vertices is even. It follows from the observation that the sum of the degrees of all the vertices of a graph is equal to twice the number of edges. Consequently, in any graph, the number of vertices of odd degree is even.
|