Exactly one vertex of the graph has degree 3. Click it.
- 1A
- 2B
- 3C
- 4D
- 5E
Exactly one vertex of the graph has degree 3. Click it.
Exactly one vertex of the graph has degree 1. Click it.
A connected graph has 19 vertices and 20 edges. How many edges k must be removed to leave a spanning tree?
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.
Find the total weight W of a minimum spanning tree of the weighted graph.
Dijkstra’s algorithm runs from A. Click the vertex that is settled (made permanent) in round 4; A itself is round 1.
Full step-by-step solutions: practise this topic on examproblems.com.