Does the following graph have an Euler circuit an Euler path

Does the following graph have an Euler circuit, an Euler path, or neither? Give reasons for your decision.

The reason for having an euler path is that

1) The graph must be connected

2) There must be exactly two vertices of odd degree present in the graph

In the above graph, there is more than 2 (odd degree vertices) present in the graph, hence there doesn\'t exists a euler path in the above graph.

Since there doesn\'t exists a euler path, hence there can\'t be a euler cycle possible in the graph.

Therefore, the graph doesn\'t have an euler circuit and euler path