An Eulerian tour is a close walk that traverses every edge e

An Eulerian tour is a close walk that traverses every edge exactly once. Find an Eulerian tour for complete graph of 7 vertices K_7. You can either use graph to show it by drawing it without lifting your pencil or redrawing a line, or list the sequence of the vertices according to the walk.

Solution

This graph is an example of An Eulerian graph with 7 vertices