In Eulerian route, each time we pay a visit to a vertex v, we walk via two unvisited edges with just one stop point as v. Therefore, all middle vertices in Eulerian Route need to have even diploma. For Eulerian Cycle, any vertex can be middle vertex, hence all vertices https://paulk162fff8.livebloggs.com/profile