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 K4 have?
K4
|E| =
3.Medium
A connected graph has 8 vertices and 8 edges. How many edges k must be removed to leave a spanning tree?
|V| = 8|E| = 8
k =
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| = 9
- 1Euler circuit
- 2Euler path, no circuit
- 3neither
5.Hard
Prim’s algorithm builds a minimum spanning tree starting from vertex A. Click the edge it adds as edge number 3.
start: Ak = 3
- 1edge AB
- 2edge AC
- 3edge BC
- 4edge BD
- 5edge CE
- 6edge DE
- 7edge BE
6.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
Answer key
- 1. Σ deg = 18
- 2. |E| = 6
- 3. k = 1
- 4. neither
- 5. edge DE
- 6. E
Full step-by-step solutions: practise this topic on examproblems.com.