Any graph has a $Euler\,path$ if the number of $odd$ degree vertices are $0\,or\,2$ and all the non-zero degree vertices belong the same component
For $Euler\,graph$ it should have a cyle i.e. number of odd degree vertices should be 0.
Here the number of odd degree vertices are 2. So, this is not a $Euler\,graph$.