The adjacency matrix of a simple undirected graph is shown. Find the degree deg(A) of vertex A.
Graph theory worksheet with answers
1.Easy
deg(A) =
2.Easy
Exactly one vertex of the graph has degree 1. Click it.
deg = 1
- 1A
- 2B
- 3C
- 4D
- 5E
- 6F
3.Medium
A connected graph has 18 vertices and 22 edges. How many edges k must be removed to leave a spanning tree?
|V| = 18|E| = 22
k =
4.Medium
How many different Hamilton circuits H does the complete graph K5 have? Circuits that differ only in the starting vertex or the direction count as the same.
K5
H =
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 6; A itself is round 1.
start: Around 6
- 1A
- 2B
- 3C
- 4D
- 5E
- 6F
- 7G
Answer key
- 1. deg(A) = 3
- 2. F
- 3. k = 5
- 4. H = 12
- 5. d(F) = 27
- 6. D
Full step-by-step solutions: practise this topic on examproblems.com.