Exactly one vertex of the graph has degree 1. Click it.
- 1A
- 2B
- 3C
- 4D
- 5E
- 6F
Exactly one vertex of the graph has degree 1. Click it.
A tree has 34 edges. How many vertices |V| does it have?
A connected graph has 16 vertices and 23 edges. How many edges k must be removed to leave a spanning tree?
A connected graph has 18 vertices and 22 edges. How many edges k must be removed to leave a spanning tree?
How many walks of length 3 go from B to E? A walk may repeat vertices and edges. Call the number N.
Use Dijkstra’s algorithm to find the length d(F) of the shortest path from A to F in the weighted graph.
Full step-by-step solutions: practise this topic on examproblems.com.