In Eulerian path, each time we pay a visit to a vertex v, we walk by means of two unvisited edges with just one end point as v. Therefore, all Center vertices in Eulerian Route needs to have even diploma. For Eulerian Cycle, any vertex might be middle vertex, as a result all vertices needs to have e