Exactly one vertex of the graph has degree 4. Click it.
- 1A
- 2B
- 3C
- 4D
- 5E
Exactly one vertex of the graph has degree 4. Click it.
A simple graph has 5 vertices with degrees 4, 3, 2, 2, 1. How many edges |E| does it have?
A tree has 4 vertices of degree 3, 3 vertices of degree 5, 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.
Use Dijkstra’s algorithm to find the length d(F) of the shortest path from A to F in the weighted graph.
Use Dijkstra’s algorithm to find the length d(D) of the shortest path from A to D in the weighted graph.
Full step-by-step solutions: practise this topic on examproblems.com.