Find the sum of the degrees of all vertices of the graph shown, Σ deg.
Graph theory worksheet with answers
1.Easy
|V| = 6
Σ deg =
2.Easy
A tree has 10 edges. How many vertices |V| does it have?
|E| = 10
|V| =
3.Medium
A tree has 2 vertices of degree 3, 2 vertices of degree 5, 3 vertices of degree 2, and all its other vertices are leaves (degree 1). How many leaves L does it have?
2 × deg 32 × deg 53 × deg 2
L =
4.Medium
Does the connected graph have an Euler circuit, an Euler path that is not a circuit, or neither? Click your answer.
|V| = 7|E| = 10
- 1Euler circuit
- 2Euler path, no circuit
- 3neither
5.Hard
Dijkstra’s algorithm runs from A. Click the vertex that is settled (made permanent) in round 5; A itself is round 1.
start: Around 5
- 1A
- 2B
- 3C
- 4D
- 5E
- 6F
- 7G
6.Hard
Dijkstra’s algorithm runs from A. Click the vertex that is settled (made permanent) in round 3; A itself is round 1.
start: Around 3
- 1A
- 2B
- 3C
- 4D
- 5E
- 6F
Answer key
- 1. Σ deg = 14
- 2. |V| = 11
- 3. L = 10
- 4. Euler path, no circuit
- 5. D
- 6. B
Full step-by-step solutions: practise this topic on examproblems.com.