I have doubt !
Wikipedia says :
An Eulerian graph is one in which all vertices have even degree; Eulerian graphs may be disconnected.
What I know :
Defitition of an euler graph
"An Euler circuit is a circuit that uses every edge of a graph exactly once. ▶ An Euler path starts and ends at different vertices. ▶ An Euler circuit starts and ends at the same vertex."
According to my little knowledge "An eluler graph should be degree of all vertices is even, and should be connected graph".
I am asking :Is it possible disconnected graph has euler circuit ? If it is possible show an example .
EDITED : Here is my suplimentary problem , I voted for the anwser .