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
A simple graph has 5 vertices with degrees 2, 2, 2, 2, 2. How many edges |E| does it have?
deg: 2, 2, 2, 2, 2
|E| =
3.Medium
A tree has 2 vertices of degree 3, 4 vertices of degree 4, and all its other vertices are leaves (degree 1). How many leaves L does it have?
2 × deg 34 × deg 4
L =
4.Medium
A tree has 3 vertices of degree 4, and all its other vertices are leaves (degree 1). How many leaves L does it have?
3 × deg 4
L =
5.Hard
Kruskal’s algorithm builds a minimum spanning tree. Click the edge it adds as edge number 5; skipped edges do not count.
k = 5
- 1edge AB
- 2edge AC
- 3edge BC
- 4edge BD
- 5edge CE
- 6edge DE
- 7edge DF
- 8edge EF
6.Hard
Prim’s algorithm builds a minimum spanning tree starting from vertex A. Click the edge it adds as edge number 4.
start: Ak = 4
- 1edge AB
- 2edge AC
- 3edge BC
- 4edge CE
- 5edge DE
- 6edge DF
- 7edge EF
- 8edge BE
Answer key
- 1. Σ deg = 18
- 2. |E| = 5
- 3. L = 12
- 4. L = 8
- 5. edge DF
- 6. edge BE
Full step-by-step solutions: practise this topic on examproblems.com.