Consider the graph below.
The minimum number of extra edges that are required so that an Eulerian trail is possible in this graph is
- 0
- 1
- 2
- 3
Show Worked Solution
`\text{Eulerian trail – every edge is used once only.}`
`text{Eulerian trails allow two vertices (only) to be odd.}`
`:.\ text{Need 1 extra edge that creates two even degree vertices (see image).}`
`=> B`