A tree has 22 edges. How many vertices |V| does it have?
Graph theory worksheet with answers
1.Easy
|E| = 22
|V| =
2.Easy
Exactly one vertex of the graph has degree 1. Click it.
deg = 1
- 1A
- 2B
- 3C
- 4D
- 5E
- 6F
3.Medium
A tree has 3 vertices of degree 3, 4 vertices of degree 5, 2 vertices of degree 2, and all its other vertices are leaves (degree 1). How many leaves L does it have?
3 × deg 34 × deg 52 × deg 2
L =
4.Medium
A tree has 2 vertices of degree 4, 4 vertices of degree 2, and all its other vertices are leaves (degree 1). How many leaves L does it have?
2 × deg 44 × deg 2
L =
5.Hard
How many walks of length 2 go from D to F? A walk may repeat vertices and edges. Call the number N.
M = adjacency matrixL = 2
N =
6.Hard
Kruskal’s algorithm builds a minimum spanning tree. Click the edge it adds as edge number 3; skipped edges do not count.
k = 3
- 1edge AB
- 2edge AC
- 3edge BC
- 4edge BD
- 5edge CE
- 6edge DE
- 7edge BE
Answer key
- 1. |V| = 23
- 2. C
- 3. L = 17
- 4. L = 6
- 5. N = 1
- 6. edge CE
Full step-by-step solutions: practise this topic on examproblems.com.