Find the sum of the degrees of all vertices of the graph shown, Σ deg.
Graph theory worksheet with answers
1.Easy
|V| = 7
Σ deg =
2.Easy
How many edges |E| does the complete graph K10 have?
K10
|E| =
3.Medium
A tree has 4 vertices of degree 4, 3 vertices of degree 5, and all its other vertices are leaves (degree 1). How many leaves L does it have?
4 × deg 43 × deg 5
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 4; A itself is round 1.
start: Around 4
- 1A
- 2B
- 3C
- 4D
- 5E
- 6F
6.Hard
Use Dijkstra’s algorithm to find the length d(F) of the shortest path from A to F in the weighted graph.
start: Aend: F
d(F) =
Answer key
- 1. Σ deg = 14
- 2. |E| = 45
- 3. L = 19
- 4. neither
- 5. E
- 6. d(F) = 23
Full step-by-step solutions: practise this topic on examproblems.com.