A tree has 20 vertices. How many edges |E| does it have?
Graph theory worksheet with answers
1.Easy
|V| = 20
|E| =
2.Easy
A simple graph has 6 vertices with degrees 3, 3, 3, 2, 2, 1. How many edges |E| does it have?
deg: 3, 3, 3, 2, 2, 1
|E| =
3.Medium
A tree has 3 vertices of degree 3, 3 vertices of degree 5, and all its other vertices are leaves (degree 1). How many leaves L does it have?
3 × deg 33 × deg 5
L =
4.Medium
A tree has 4 vertices of degree 3, 3 vertices of degree 4, 2 vertices of degree 5, and all its other vertices are leaves (degree 1). How many leaves L does it have?
4 × deg 33 × deg 42 × deg 5
L =
5.Hard
Prim’s algorithm builds a minimum spanning tree starting from vertex F. Click the edge it adds as edge number 6.
start: Fk = 6
- 1edge AC
- 2edge BC
- 3edge BD
- 4edge CE
- 5edge DE
- 6edge DF
- 7edge EF
- 8edge GB
- 9edge GC
- 10edge GD
6.Hard
Find the total weight W of a minimum spanning tree of the weighted graph.
|V| = 7|E| = 12
W =
Answer key
- 1. |E| = 19
- 2. |E| = 7
- 3. L = 14
- 4. L = 18
- 5. edge AC
- 6. W = 24
Full step-by-step solutions: practise this topic on examproblems.com.