Exactly one vertex of the graph has degree 1. Click it.
- 1A
- 2B
- 3C
- 4D
- 5E
- 6F
- 7G
Exactly one vertex of the graph has degree 1. Click it.
Exactly one vertex of the graph has degree 3. Click it.
A tree has 4 vertices of degree 4, and all its other vertices are leaves (degree 1). How many leaves L does it have?
Does the connected graph have an Euler circuit, an Euler path that is not a circuit, or neither? Click your answer.
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.