How many vertices have an odd degree?
Question 1 options:
1
2
3
4
Question 2 (1 point)
If a graph has exactly 2 odd vertices, then
Question 2 options:
an Euler circuit exists
no circuit exists
at least one path exists
no path exists
Question 3 (1 point)
Which path shows trace-ability?
Question 3 options:
EA,AB,BC,CD,DE
EA,AB,BC,CD,DE,EC,CA
AC,CB,BA,AE,ED,DC
BC,CD,DE,EA,AB
Question 4 (1 point)
Saved
In order to trace this graph without lifting your pen or retracing an edge you COULD begin at vertex
Question 4 options:
A
B
C
D
Question 5 (1 point)
Saved
This graph has a/is
Question 5 options:
Euler Circuit
Euler Path
Not traceable
Euler Circuit and Euler Path



