更改

==Handshaking lemma==

==Handshaking lemma 握手引理==

握手引理

握手引理

{{main|Handshaking lemma}}

{{main|Handshaking lemma}}

The formula implies that in any undirected graph, the number of vertices with odd degree is even. This statement (as well as the degree sum formula) is known as the handshaking lemma. The latter name comes from a popular mathematical problem, to prove that in any group of people the number of people who have shaken hands with an odd number of other people from the group is even.

The formula implies that in any undirected graph, the number of vertices with odd degree is even. This statement (as well as the degree sum formula) is known as the handshaking lemma. The latter name comes from a popular mathematical problem, to prove that in any group of people the number of people who have shaken hands with an odd number of other people from the group is even.

该公式表明，在任何无向图中，拥有奇数度值的顶点的个数是偶数。这个陈述(以及度和公式)被称为'''<font color="#ff8000">握手引理 Handshaking Lemma</font>'''。该名字来自一个有趣的数学问题，即证明无论该群体内有多少人，与奇数个人握过手的人数是偶数。

此公式表明，在任何无向图中，拥有奇数度值的顶点的个数是偶数。这一阐释（以及度和公式)被称为'''<font color="#ff8000">握手引理 Handshaking Lemma</font>'''。该名称来自一个有趣的数学问题，即证明无论该群体内有多少人，与奇数个人握过手的人数总是偶数。

   --[[用户:趣木木|趣木木]]（[[用户讨论:趣木木|讨论]]）标题涉及到的专业名词 要么标注一下标题要么标注一下正文~

   --[[用户:趣木木|趣木木]]（[[用户讨论:趣木木|讨论]]）标题涉及到的专业名词 要么标注一下标题要么标注一下正文~