How many edges |E| does the complete bipartite graph K5,8 have?
Graph theory worksheet with answers
1.Easy
K5,8
|E| =
2.Easy
Exactly one vertex of the graph has degree 1. Click it.
deg = 1
- 1A
- 2B
- 3C
- 4D
- 5E
- 6F
- 7G
3.Medium
Does the connected graph have an Euler circuit, an Euler path that is not a circuit, or neither? Click your answer.
|V| = 5|E| = 5
- 1Euler circuit
- 2Euler path, no circuit
- 3neither
4.Medium
A connected graph has 13 vertices and 18 edges. How many edges k must be removed to leave a spanning tree?
|V| = 13|E| = 18
k =
5.Hard
Find the total weight W of a minimum spanning tree of the weighted graph.
|V| = 7|E| = 9
W =
6.Hard
How many walks of length 2 go from C to D? A walk may repeat vertices and edges. Call the number N.
M = adjacency matrixL = 2
N =
Answer key
- 1. |E| = 40
- 2. A
- 3. Euler path, no circuit
- 4. k = 6
- 5. W = 52
- 6. N = 2
Full step-by-step solutions: practise this topic on examproblems.com.