Skip to Content
16 questions
Show Answers
See Preview
- 1. Multiple-choice30 seconds1 pt
What is the degree of vertex 4?
3
4
5
7
- 2. Multiple-choice30 seconds1 pt
Which two vertices are adjacent vertices?
5 is adjacent to 6
3 is adjacent to 6
4 is adjacent to 1
3 is adjacent to 2
- 3. Multiple-choice30 seconds1 pt
The graph represents the following vocabulary term.
Cycle
Path
Complete Graph
Complete Bipartite Graph
- 4. Multiple-choice30 seconds1 pt
The graph is an example of a
Path
Cycle
Complete Bipartite Graph
Complete Graph
- 5. Multiple-choice30 seconds1 pt
Which vocabulary term describes the graph?
circuit
path
complete graph
polygon
- 6. Multiple-choice30 seconds1 pt
Which of the following are isolated vertices?
F
G
Graphs are fun.
F and G
- 7. Multiple-choice30 seconds1 pt
Which of the following is a loop?
BC
EE
AB
BF
none
- 8. Multiple-choice30 seconds1 pt
What is the degree of vertex E?
1
2
3
4
5
- 9. Multiple-choice20 seconds1 ptEuler paths must touchall edgesall vertices
- 10. Multiple-choice2 minutes1 ptThis graph will have a Euler's CircuitTrueFalse
- 11. Multiple-choice20 seconds1 pt
Circuits start and stop at
same vertex
different vertices
DUI Checkpoints
the sound of the bass
- 12. Multiple-choice20 seconds1 pt
Paths start and stop at
same vertex
different vertices
the beginning and the end
green lights and red lights
- 13. Multiple-choice30 seconds1 pt
Eulerian and Hamiltonian graphs are disconnected graphs
True
False
- 14. Multiple-choice30 seconds1 pt
Is the following graph connected?
Yes
No
- 15. Multiple-choice30 seconds1 pt
Is the following graph connected?
Yes
No
- 16. Multiple-choice30 seconds1 pt
A Hamiltonian cycle is
A cycle that includes every vertex
A cycle that includes every vertex more than once
A cycle that includes every edge
A cycle that includes every edge more than once
