A tree has 39 vertices. How many edges |E| does it have?
Graph theory worksheet with answers
1.Easy
|V| = 39
|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 connected graph has 6 vertices and 8 edges. How many edges k must be removed to leave a spanning tree?
|V| = 6|E| = 8
k =
4.Medium
A connected graph has 6 vertices and 14 edges. How many edges k must be removed to leave a spanning tree?
|V| = 6|E| = 14
k =
5.Hard
Use Dijkstra’s algorithm to find the length d(F) of the shortest path from A to F in the weighted graph.
start: Aend: F
d(F) =
6.Hard
Prim’s algorithm builds a minimum spanning tree starting from vertex F. Click the edge it adds as edge number 5.
start: Fk = 5
- 1edge AB
- 2edge BC
- 3edge BD
- 4edge CE
- 5edge DE
- 6edge DF
- 7edge EF
- 8edge BE
Answer key
- 1. |E| = 38
- 2. |E| = 7
- 3. k = 3
- 4. k = 9
- 5. d(F) = 29
- 6. edge CE
Full step-by-step solutions: practise this topic on examproblems.com.