Please answer me that question
A degree of a vertex is the number of other vertices connected to it. Show that the the sum of the graph vertex degrees is always even.
it is related to graphs in C++
Please answer me that question
A degree of a vertex is the number of other vertices connected to it. Show that the the sum of the graph vertex degrees is always even.
it is related to graphs in C++
First link in a Google search brings us to ... math.stackexchange
The sum of all the degrees is equal to twice the number of edges. Since the sum of the degrees is even and the sum of the degrees of vertices with even degree is even, the sum of the degrees of vertices with odd degree must be even. If the sum of the degrees of vertices with odd degree is even, there must be an even number of those vertices.
By the way this has nothing to do with "C++ graphs". It is a general property of graphs as per their mathematical definition
Edit :
This statement is only valid for undirected graphs, and is called the Handshaking lemma.