1 pt Which of the following graphs have Euler circuits or Eu

(1 pt) Which of the following graphs have Euler circuits or Euler trails? A: Has Euler trail. B: Has Euler trail. A: Has Euler circuit. B: Has Euler circuit. C: Has Euler trail. D: Has Euler trail. C: Has Euler circuit. D: Has Euler circuit.

Solution

In graph theory,

a Euler trail (or Eulerian path) is a trail in a graph which visits every edge exactly once. Similarly, an Euler

circuit or (Eulerian cycle) is an Eulerian trail which starts and ends on the same vertex.

for decisiding euler trial or euler circuit, there are some rule(euler\'s theorem)

Euler