Handshaking lemma
id:
handshaking-lemma-312-5991786
title:
Handshaking lemma
text:
In graph theory, a branch of mathematics, 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. For example, if there is a party of people who shake hands, the number of people who shake an odd number of other people's hands is even. The handshaking lemma is a consequence of the degree sum formula, also sometimes called the handshaking lemma, according to which the sum of the degrees equals twice the numb
brand slug:
wiki
category slug:
encyclopedia
description:
Every graph has evenly many odd vertices
original url:
https://en.wikipedia.org/wiki/Handshaking_lemma
date created:
date modified:
2023-02-13T06:35:12Z
main entity:
{"identifier":"Q954454","url":"https://www.wikidata.org/entity/Q954454"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/5/5b/6n-graf.svg","width":333,"height":220}
fields total:
13
integrity:
15