Exactly one vertex of the graph has degree 1. Click it.
- 1A
- 2B
- 3C
- 4D
- 5E
Exactly one vertex of the graph has degree 1. Click it.
A simple graph has 5 vertices with degrees 3, 3, 3, 2, 1. How many edges |E| does it have?
How many different Hamilton circuits H does the complete graph K7 have? Circuits that differ only in the starting vertex or the direction count as the same.
A tree has 2 vertices of degree 5, 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(G) of the shortest path from A to G in the weighted graph.
Dijkstra’s algorithm runs from A. Click the vertex that is settled (made permanent) in round 5; A itself is round 1.
Full step-by-step solutions: practise this topic on examproblems.com.