Question

a graph is given to the right
a. explain why the graph has at least one euler circuit.
b. use trial and error or fleury’s algorithm to find one such circuit.
a. choose the correct explanation below
a. it has exactly two odd vertices
b. it has no even vertices
c. it has no odd vertices
d. all graphs have at least one euler circuit

Explanation:

According to Euler's theorem, a connected graph has an Euler circuit if and only if it has no odd - degree vertices. So, we need to check the degree of each vertex in the graph.

Answer:

C. It has no odd vertices