A simple graph has 5 vertices with degrees 4, 2, 2, 1, 1. How many edges |E| does it have?
Graph theory worksheet with answers
1.Easy
deg: 4, 2, 2, 1, 1
|E| =
2.Easy
Exactly one vertex of the graph has degree 4. Click it.
deg = 4
- 1A
- 2B
- 3C
- 4D
- 5E
- 6F
- 7G
3.Medium
A tree has 4 vertices of degree 4, 2 vertices of degree 2, and all its other vertices are leaves (degree 1). How many leaves L does it have?
4 × deg 42 × deg 2
L =
4.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| = 10
- 1Euler circuit
- 2Euler path, no circuit
- 3neither
5.Hard
Find the total weight W of a minimum spanning tree of the weighted graph.
|V| = 7|E| = 11
W =
6.Hard
How many closed walks of length 3 start and end at E? A walk may repeat vertices and edges. Call the number N.
M = adjacency matrixL = 3
N =
Answer key
- 1. |E| = 5
- 2. G
- 3. L = 10
- 4. neither
- 5. W = 37
- 6. N = 4
Full step-by-step solutions: practise this topic on examproblems.com.