![image]https://www.dropbox.com/s/o5ybtns0qd7t4b4/s.png?dl=0
Give an example of a Eulerian Path of the graph that starts at A
Isn't the graph Eulerian if it has 2 odd number of degrees? when i counted the degrees they were all 4 so how do calculate the eulerian path?
On
Suppose that $G$ has all even-degree vertices. Pick any two vertices that are connected and remove the edge. Then the resulting graph has exactly two odd-degree vertices, so it has an Euler path. That path must begin at one of the odd-degree vertices and end at the other, so adding the edge back in, we can continue the path from one of those vertices back to the other. Thus if $G$ has all even-degree vertices, we get an Euler cycle, while if it has two odd-degree vertices, we get only a path.
You can start from A. At each step, don't go to any vertex you have visited before until you have visited them all. You will have an Eulerean path. If you then return to A, you will have an Eulerean circuit. On a complete graph with and odd number of vertices, you can't miss.