How many edges |E| does the complete graph K6 have?
Graph theory worksheet with answers
1.Easy
K6
|E| =
2.Easy
A simple graph has 6 vertices with degrees 4, 2, 2, 2, 2, 2. How many edges |E| does it have?
deg: 4, 2, 2, 2, 2, 2
|E| =
3.Medium
A connected graph has 7 vertices and 17 edges. How many edges k must be removed to leave a spanning tree?
|V| = 7|E| = 17
k =
4.Medium
A connected graph has 14 vertices and 21 edges. How many edges k must be removed to leave a spanning tree?
|V| = 14|E| = 21
k =
5.Hard
How many walks of length 2 go from B to D? A walk may repeat vertices and edges. Call the number N.
M = adjacency matrixL = 2
N =
6.Hard
Find the total weight W of a minimum spanning tree of the weighted graph.
|V| = 7|E| = 10
W =
Answer key
- 1. |E| = 15
- 2. |E| = 7
- 3. k = 11
- 4. k = 8
- 5. N = 1
- 6. W = 45
Full step-by-step solutions: practise this topic on examproblems.com.