Exactly one vertex of the graph has degree 4. Click it.
- 1A
- 2B
- 3C
- 4D
- 5E
- 6F
- 7G
Exactly one vertex of the graph has degree 4. Click it.
Find the sum of the degrees of all vertices of the graph shown, Σ deg.
Does the connected graph have an Euler circuit, an Euler path that is not a circuit, or neither? Click your answer.
A tree has 4 vertices of degree 4, 4 vertices of degree 2, and all its other vertices are leaves (degree 1). How many leaves L does it have?
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 F? A walk may repeat vertices and edges. Call the number N.
Full step-by-step solutions: practise this topic on examproblems.com.