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 bipartite graph K4,11 have?
K4,11
|E| =
3.Medium
A tree has 2 vertices of degree 3, 4 vertices of degree 4, 2 vertices of degree 5, 4 vertices of degree 2, and all its other vertices are leaves (degree 1). How many leaves L does it have?
2 × deg 34 × deg 42 × deg 54 × deg 2
L =
4.Medium
A tree has 4 vertices of degree 3, 4 vertices of degree 4, 4 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?
4 × deg 34 × deg 44 × deg 53 × deg 2
L =
5.Hard
Prim’s algorithm builds a minimum spanning tree starting from vertex E. Click the edge it adds as edge number 3.
start: Ek = 3
- 1edge AB
- 2edge AC
- 3edge BC
- 4edge BD
- 5edge DE
- 6edge DF
- 7edge EF
- 8edge BE
6.Hard
How many walks of length 3 go from B to D? A walk may repeat vertices and edges. Call the number N.
M = adjacency matrixL = 3
N =
Answer key
- 1. Σ deg = 16
- 2. |E| = 44
- 3. L = 18
- 4. L = 26
- 5. edge BD
- 6. N = 6
Full step-by-step solutions: practise this topic on examproblems.com.