Have an account?
Skip to Content
Build your own quiz
Suggestions for you
14 questions
Show Answers
See Preview
- 1. Multiple Choice
Is this diagram correctly labelled?
Yes
No
- 2. Multiple Choice
What is the degree of Vertex A?
2
3
4
5
- 3. Multiple Choice
What is the degree of Vertex C?
2
3
4
5
- 4. Multiple Choice
What is the degree of Vertex E?
2
3
4
5
- 5. Multiple Choice
Determine the adjacency matrix for this network:
- 6. Multiple Choice
In a network a Walk is any route taken through a network, including routes that repeat edges and vertices. What is a Trail?
A walk in which no vertices are repeated, except possibly the start and finish
A walk in which no edges are repeated
- 7. Multiple Choice
What is a Eulerian Path?
A path in a graph that visits every edge exactly once and returns to the start.
A path in a graph that visits every vertex exactly once and returns to the start.
A path beginning and ending at the same vertex.
- 8. Multiple Choice
What is a Hamiltonian Path?
A path in a graph that visits every edge exactly once and returns to the start.
A path in a graph that visits every vertex exactly once and returns to the start.
A path beginning and ending at the same vertex.
- 9. Multiple Choice
What is a Sumi-Eulerian Path?
A path in a graph that visits every edge exactly once without returning to the start.
A path in a graph that visits every vertex exactly once without returning to the start.
A path beginning and ending at the same vertex.
- 10. Multiple Choice
What is a Sumi-Hamiltonian Path?
A path in a graph that visits every edge exactly once without returning to the start.
A path in a graph that visits every vertex exactly once without returning to the start.
A path beginning and ending at the same vertex.
- 11. Multiple Choice
How do you determine whether a graph is Semi-Eulerian?
All vertices are even
One odd vertex
Two odd vertices
Three odd vertices
- 12. Multiple Choice
How do you determine whether a graph is Eulerian?
All vertices are even
One odd vertex
Two odd vertices
Three odd vertices
- 13. Multiple Choice
This graph has a Hamiltonian Circuit. True or False?
False
True
- 14. Multiple Choice
In a network a Walk is any route taken through a network, including routes that repeat edges and vertices. What is a Path?
A trail in which no vertices are repeated, except possibly the start and finish
A trail in which no edges are repeated
- Answer choicesTagsAnswer choicesTags