Exactly one vertex of the graph has degree 3. Click it.
- 1A
- 2B
- 3C
- 4D
- 5E
- 6F
Exactly one vertex of the graph has degree 3. Click it.
The adjacency matrix of a simple undirected graph is shown. How many edges |E| does the graph have?
A connected graph has 19 vertices and 22 edges. How many edges k must be removed to leave a spanning tree?
A tree has 3 vertices of degree 3, 3 vertices of degree 4, and all its other vertices are leaves (degree 1). How many leaves L does it have?
Dijkstra’s algorithm runs from A. Click the vertex that is settled (made permanent) in round 5; A itself is round 1.
How many walks of length 2 go from B to D? A walk may repeat vertices and edges. Call the number N.
Full step-by-step solutions: practise this topic on examproblems.com.