Exactly one vertex of the graph has degree 4. Click it.
- 1A
- 2B
- 3C
- 4D
- 5E
- 6F
Exactly one vertex of the graph has degree 4. Click it.
Exactly one vertex of the graph has degree 3. Click it.
Does the connected graph have an Euler circuit, an Euler path that is not a circuit, or neither? Click your answer.
A connected graph has 18 vertices and 24 edges. How many edges k must be removed to leave a spanning tree?
Find the total weight W of a minimum spanning tree of the weighted graph.
Kruskal’s algorithm builds a minimum spanning tree. Click the edge it adds as edge number 3; skipped edges do not count.
Full step-by-step solutions: practise this topic on examproblems.com.