A simple graph has 5 vertices with degrees 2, 2, 2, 2, 2. How many edges |E| does it have?
Graph theory worksheet with answers
1.Easy
deg: 2, 2, 2, 2, 2
|E| =
2.Easy
The adjacency matrix of a simple undirected graph is shown. Find the degree deg(A) of vertex A.
deg(A) =
3.Medium
Does the connected graph have an Euler circuit, an Euler path that is not a circuit, or neither? Click your answer.
|V| = 7|E| = 8
- 1Euler circuit
- 2Euler path, no circuit
- 3neither
4.Medium
How many different Hamilton circuits H does the complete graph K8 have? Circuits that differ only in the starting vertex or the direction count as the same.
K8
H =
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
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. |E| = 5
- 2. deg(A) = 2
- 3. neither
- 4. H = 2520
- 5. E
- 6. F
Full step-by-step solutions: practise this topic on examproblems.com.