A tree has 37 edges. How many vertices |V| does it have?
Graph theory worksheet with answers
1.Easy
|E| = 37
|V| =
2.Easy
How many edges |E| does the complete graph K5 have?
K5
|E| =
3.Medium
A tree has 4 vertices of degree 3, 2 vertices of degree 2, and all its other vertices are leaves (degree 1). How many leaves L does it have?
4 × deg 32 × deg 2
L =
4.Medium
A tree has 4 vertices of degree 3, 4 vertices of degree 2, and all its other vertices are leaves (degree 1). How many leaves L does it have?
4 × deg 34 × deg 2
L =
5.Hard
Find the total weight W of a minimum spanning tree of the weighted graph.
|V| = 6|E| = 9
W =
6.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) =
Answer key
- 1. |V| = 38
- 2. |E| = 10
- 3. L = 6
- 4. L = 6
- 5. W = 35
- 6. d(F) = 15
Full step-by-step solutions: practise this topic on examproblems.com.