Exactly one vertex of the graph has degree 4. Click it.
- 1A
- 2B
- 3C
- 4D
- 5E
- 6F
Exactly one vertex of the graph has degree 4. Click it.
How many edges |E| does the complete graph K10 have?
A connected graph has 17 vertices and 25 edges. How many edges k must be removed to leave a spanning tree?
A tree has 2 vertices of degree 3, 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(E) of the shortest path from A to E in the weighted graph.
Find the total weight W of a minimum spanning tree of the weighted graph.
Full step-by-step solutions: practise this topic on examproblems.com.