#Can a graph with 2 nodes of degree 5 have an Euler path?
16 messages · Page 1 of 1 (latest)
- Wait patiently for a helper to come along.
- Once someone helps you, say thank you and close the thread with:
+close
- Feel free to nominate the person for helper of the week in #helper-nominations
- Do not ping the mods, unless someone is breaking the rules.
- If you're happy with the help you got here, and the server overall, you can contribute financially as well:
Yes, for every oddnit also works:
This is for two vertices of degree 5
But you can add triangles to make 2 vertices of odd degree (can be different)
ty :)
@cobalt hill has given 1 rep to @naive trout
What would happen if there were 4 vertices of an odd degree? Is an Eulerian path impossible then?
no, its only possible if and only if there are 0 or 2 odd degree vertices
If I recall correctly, shouldn't one odd-degree vertex also be possible?
If there are no odd-degree vertices, you can start from and end anywhere.
If there is one odd-degree vertex, you have to start and end on it.
If there are two odd-degree vertices, you have to start on one and end on the other.
And you can't do it for more than two.
Though, now that I think about it, I can't think of any graphs with just one odd-degree vertex...
No 1 odd degree isn't possible because if you start on it you can't end on it and there are no other odd degree vertices
As far as simple graphs(not digraphs) are concerned, I think there is a basic theorem like there must an even number of vertices with an odd number. So that 1 vertex with an odd degree graph wouldn't exist, forget about the Eulerian Path.
Ohh, I see. Thanks!