Graph Theory
- Created by: Harry
- Created on: 09-05-13 20:15
Other questions in this quiz
2. If a completed graph has n vertices, how many edges does it have?
- n(n-1)/2
- (n-1)/2
- n-1
- n-(2/2)
3. A completed graph is a...
- graph in which every vertex is connected by an edge to each of the other vertex
- possible graph
- a finished graph
4. What is a cycle
- A closed path with at least one edge
- a closed path with at least n-1 edges
5. What is a Path
- A trail such that no vertex is visited more than once
- 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.
- a closed trail with at least n-1 edges
Similar Mathematics resources:
Teacher recommended
Comments
No comments have yet been made