A 2-regular graph has 9 vertices (every vertex has degree 2). How many edges |E| does it have?
Graph theory worksheet with answers
1.Easy
n = 9k = 2
|E| =
2.Easy
The adjacency matrix of a simple undirected graph is shown. Find the degree deg(B) of vertex B.
deg(B) =
3.Medium
A connected graph has 11 vertices and 12 edges. How many edges k must be removed to leave a spanning tree?
|V| = 11|E| = 12
k =
4.Medium
A connected graph has 13 vertices and 14 edges. How many edges k must be removed to leave a spanning tree?
|V| = 13|E| = 14
k =
5.Hard
Prim’s algorithm builds a minimum spanning tree starting from vertex A. Click the edge it adds as edge number 3.
start: Ak = 3
- 1edge AB
- 2edge AC
- 3edge BC
- 4edge BD
- 5edge CE
- 6edge DE
- 7edge BE
6.Hard
How many walks of length 3 go from B to C? A walk may repeat vertices and edges. Call the number N.
M = adjacency matrixL = 3
N =
Answer key
- 1. |E| = 9
- 2. deg(B) = 2
- 3. k = 2
- 4. k = 2
- 5. edge BE
- 6. N = 5
Full step-by-step solutions: practise this topic on examproblems.com.