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.
A tree has 25 edges. How many vertices |V| does it have?
A connected graph has 6 vertices and 7 edges. How many edges k must be removed to leave a spanning tree?
Does the connected graph have an Euler circuit, an Euler path that is not a circuit, or neither? Click your answer.
Use Dijkstra’s algorithm to find the length d(F) of the shortest path from A to F in the weighted graph.
How many walks of length 3 go from D to B? A walk may repeat vertices and edges. Call the number N.
Full step-by-step solutions: practise this topic on examproblems.com.