Exactly one vertex of the graph has degree 3. Click it.
- 1A
- 2B
- 3C
- 4D
- 5E
Exactly one vertex of the graph has degree 3. Click it.
Find the sum of the degrees of all vertices of the graph shown, Σ deg.
How many different Hamilton circuits H does the complete graph K6 have? Circuits that differ only in the starting vertex or the direction count as the same.
Does the connected graph have an Euler circuit, an Euler path that is not a circuit, or neither? Click your answer.
Kruskal’s algorithm builds a minimum spanning tree. Click the edge it adds as edge number 5; skipped edges do not count.
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.