Have an account?
Skip to Content
Build your own quiz
.png)
20 questions
Show Answers
See Preview
- 1. Multiple Choice
Which of the following is a Hamilton circuit of the graph?ABCDEFGAACBEGFDACBGEDFACCEGBADFC - 2. Multiple ChoiceList a path from vertex D to vertex GDAFCEBGDFACEBGDECAFBGDCBAFEG
- 3. Multiple ChoiceTrue or false: With Hamilton circuits, every edge must be used. With Euler circuits, every vertex must be used.TrueFalse
- 4. Multiple ChoiceTracing all edges on a figure without picking up your pencil and repeating and starting and stopping in the same spotEuler CircuitEuler Path
- 5. Multiple ChoiceTracing all edges on a figure without picking up your pencil or repeating and starting and stopping at different spotsEuler CircuitEuler Path
- 6. Multiple ChoiceCircuits start and stop atsame vertexdifferent vertices
- 7. Multiple ChoicePaths start and stop atsame vertexdifferent vertices
- 8. Multiple ChoiceEuler paths must touchall edgesall vertices
- 9. 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.
- 10. Multiple ChoiceDoes this graph have an Euler Path, Euler Circuit, both, or neither?Euler PathEuler CircuitBothNeither
- 11. Multiple ChoiceTouching all vertices in a figure without repeating or picking up your pencil and starting and stopping at different spotsEuler CircuitEuler PathHamilton CircuitHamilton Path
- 12. Multiple ChoiceTouching all vertices in a figure without repeating or picking up your pencil and starting and stopping at same spotEuler CircuitEuler PathHamilton CircuitHamilton Path
- 13. Multiple ChoiceHamilton touchesall edgesall vertices
- 14. Multiple ChoiceThis graph will have a Euler's Path.TrueFalse
- 15. Multiple ChoiceThis graph will have a Euler's CircuitTrueFalse
- 16. Multiple ChoiceIn a Euler's Circuit or Path, you cannot use a vertex twice.TrueFalse
- 17. 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
- 18. 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.
- 19. Multiple ChoiceA given graph has vertices with the given degrees: 3, 5, 6, 8, 2
What is DEFINITELY TRUE?This graph will be a Euler's CurcuitThis graph will be a Euler's PathThis graph will be a Hamiltonian PathI need more information - 20. Multiple ChoiceA graph has the vertices with the following degrees: 4, 6, 8, 2, 2, 6, 4
What do we DEFINITELY KNOW?This will have a Euler's CircuitThis will have a Euler's PathThis will have a Hamiltonian PathWe need more information - Answer choicesTagsAnswer choicesTags