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
Find the sum of the degrees of all vertices of the graph shown, Σ deg.
|V| = 7
Σ deg =
3.Medium
How many different Hamilton circuits H does the complete graph K4 have? Circuits that differ only in the starting vertex or the direction count as the same.
K4
H =
4.Medium
A connected graph has 14 vertices and 24 edges. How many edges k must be removed to leave a spanning tree?
|V| = 14|E| = 24
k =
5.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
- 7G
6.Hard
Prim’s algorithm builds a minimum spanning tree starting from vertex A. Click the edge it adds as edge number 4.
start: Ak = 4
- 1edge AB
- 2edge AC
- 3edge BC
- 4edge BD
- 5edge CE
- 6edge DE
- 7edge BE
Answer key
- 1. deg(D) = 2
- 2. Σ deg = 18
- 3. H = 3
- 4. k = 11
- 5. C
- 6. edge DE
Full step-by-step solutions: practise this topic on examproblems.com.