Question

Show that a connected graph has An Eulerian trail iff it has exactly two odd degree vertices

Answer 1

If a graph (connected or disconnected) has exactly two vertices of odd degree then there must be a path joining these vertices. Proof. ... Since, the number of vertices of odd degree in any graph is even, C has to contain another vertex of odd degree.