How many edges |E| does the complete bipartite graph K4,4 have?
Graph theory worksheet with answers
1.Easy
K4,4
|E| =
2.Easy
Find the sum of the degrees of all vertices of the graph shown, Σ deg.
|V| = 6
Σ deg =
3.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 =
4.Medium
A tree has 3 vertices of degree 3, 3 vertices of degree 4, 3 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 33 × deg 43 × deg 52 × deg 2
L =
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
Use Dijkstra’s algorithm to find the length d(E) of the shortest path from A to E in the weighted graph.
start: Aend: E
d(E) =
Answer key
- 1. |E| = 16
- 2. Σ deg = 18
- 3. L = 6
- 4. L = 20
- 5. d(F) = 30
- 6. d(E) = 12
Full step-by-step solutions: practise this topic on examproblems.com.