A given connected graph G is a Euler Graphif and only if all vertices of G are of

A

Same degree

B

Even degree

C

Odd degree

D

Different degree