Skip to content
Back to quiz
6. What is a Trail
- A sequence of edges of a graph such that the second vertex of each edge is the first vertex of the next edge, with no edge included more than once.
- closed path with at least one edge
7. If a graph has directed edges we do not call it a...
- directional graph
- digraph
- directed graph
8. If a completed graph has n vertices, how many edges does it have?
- n-(2/2)
- n(n-1)/2
- n-1
- (n-1)/2
9. What is a cycle
- A closed path with at least one edge
- a closed path with at least n-1 edges