Have an account?
Skip to Content
Build your own quiz
13 questions
Show Answers
See Preview
- 1. Multiple ChoiceTracing all edges on a figure without picking up your pencil or repeating and starting and stopping at different spotsEuler CircuitEuler Path
- 2. Multiple ChoiceTracing all edges on a figure without picking up your pencil and repeating and starting and stopping in the same spotEuler CircuitEuler Path
- 3. Multiple ChoiceCircuits start and stop atsame vertexdifferent vertices
- 4. Multiple ChoicePaths start and stop atsame vertexdifferent vertices
- 5. Multiple ChoiceEuler paths must touchall edgesall vertices
- 6. Multiple ChoiceWhich of the following is false?Euler Paths exist when there are exactly two vertices of odd degree.Euler circuits exist when the degree of all vertices are even.A graph with more than two odd vertices will never have an Euler Path or Circuit.A graph with one odd vertex will have an Euler Path but not an Euler Circuit.
- 7. Multiple Choice
Does this graph have an Euler Path, Euler Circuit, both, or neither?Euler PathEuler CircuitBothNeither - 8. Multiple ChoiceThis graph will have a Euler's Path.TrueFalse
- 9. Multiple ChoiceThis graph will have a Euler's CircuitTrueFalse
- 10. Multiple ChoiceIdentify the Euler's CircuitKLQPQOKLOMKKLQMPQOKNLOMKKLQMPQOKKMOLNKOQMK
- 11. Multiple ChoiceDoes this graph have a Euler's Path?TrueFalse
- 12. Multiple ChoiceHow do we quickly determine if a graph will have a Euler's Circuit?All even degree verticiesExactly 2 odd degree verticiesEvery Vertex will be used onceI have no clue
- 13. Multiple ChoiceHow do we quickly determine if the graph will have a Euler's PathAll even degree verticiesExactly 2 odd degree verticiesEach vertex will be used onceI have no clue.
- Answer choicesTagsAnswer choicesTags