The adjacency matrix of a simple undirected graph is shown. Find the degree deg(D) of vertex D.
Graph theory worksheet with answers
1.Easy
deg(D) =
2.Easy
A 4-regular graph has 11 vertices (every vertex has degree 4). How many edges |E| does it have?
n = 11k = 4
|E| =
3.Medium
A tree has 3 vertices of degree 3, 4 vertices of degree 5, and all its other vertices are leaves (degree 1). How many leaves L does it have?
3 × deg 34 × deg 5
L =
4.Medium
A connected graph has 10 vertices and 18 edges. How many edges k must be removed to leave a spanning tree?
|V| = 10|E| = 18
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
Dijkstra’s algorithm runs from A. Click the vertex that is settled (made permanent) in round 4; A itself is round 1.
start: Around 4
- 1A
- 2B
- 3C
- 4D
- 5E
- 6F
Answer key
- 1. deg(D) = 2
- 2. |E| = 22
- 3. L = 17
- 4. k = 9
- 5. d(F) = 29
- 6. E
Full step-by-step solutions: practise this topic on examproblems.com.