11. Given the following graph. e a) Does this graph have an Euler circuit? If so, list one.

# We are entitled to solve only one question at a time ,please resubmit the other question if you wish to get it answered.

11.

(a)

Calculate the degree of each vertex as follows

$$\begin{gathered} e=2 \\ a=4 \\ b=4 \\ c=3 \\ d=3 \end{gathered}$$

the graph has a Euler circuit if all the vertices have even degree, 

since there are two vertices of odd degree, therefore the graph do not have Euler circuit