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
Aussie Maths & Science Teachers: Save your time with SmarterEd
Consider the graph below.
The minimum number of extra edges that are required so that an Eulerian trail is possible in this graph is