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.
A tree has 35 vertices. How many edges |E| does it have?
How many different Hamilton circuits H does the complete graph K5 have? Circuits that differ only in the starting vertex or the direction count as the same.
A tree has 4 vertices of degree 3, 4 vertices of degree 4, 3 vertices of degree 5, and all its other vertices are leaves (degree 1). How many leaves L does it have?
Find the total weight W of a minimum spanning tree of the weighted graph.
Use Dijkstra’s algorithm to find the length d(F) of the shortest path from A to F in the weighted graph.
Full step-by-step solutions: practise this topic on examproblems.com.