The adjacency matrix of a simple undirected graph is shown. How many edges |E| does the graph have?
Graph theory worksheet with answers
1.Easy
|E| =
2.Easy
How many edges |E| does the complete bipartite graph K4,10 have?
K4,10
|E| =
3.Medium
How many different Hamilton circuits H does the complete graph K5 have? Circuits that differ only in the starting vertex or the direction count as the same.
K5
H =
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
Prim’s algorithm builds a minimum spanning tree starting from vertex A. Click the edge it adds as edge number 4.
start: Ak = 4
- 1edge AB
- 2edge AC
- 3edge BC
- 4edge BD
- 5edge CE
- 6edge DE
- 7edge BE
6.Hard
Prim’s algorithm builds a minimum spanning tree starting from vertex B. Click the edge it adds as edge number 5.
start: Bk = 5
- 1edge AB
- 2edge AC
- 3edge BC
- 4edge BD
- 5edge CE
- 6edge DE
- 7edge EF
- 8edge BE
Answer key
- 1. |E| = 4
- 2. |E| = 40
- 3. H = 12
- 4. H = 2520
- 5. edge CE
- 6. edge AB
Full step-by-step solutions: practise this topic on examproblems.com.