Solution to 3. Proof that an undirected graph has an even number of vertices of odd degree. - Sikademy
Author Image

Archangel Macsika

3. Proof that an undirected graph has an even number of vertices of odd degree.

The Answer to the Question
is below this banner.

Can't find a solution anywhere?

NEED A FAST ANSWER TO ANY QUESTION OR ASSIGNMENT?

Get the Answers Now!

You will get a detailed answer to your question or assignment in the shortest time possible.

Here's the Solution to this Question

This sum must be even because the sum of the degrees of all vertices is equal to 2m, where m is a number of edges, and thus it is even, and the sum of the degrees of the vertices of even degrees is also even. Because this is the sum of the degrees of all vertices of odd degree in the graph, there must be an even number of such vertices.


Related Answers

Was this answer helpful?

Join our Community to stay in the know

Get updates for similar and other helpful Answers

Question ID: mtid-5-stid-8-sqid-689-qpid-574