Discrete Structure - Old Questions
19. An undirected graph is a tree if and only if there is a unique simple path between any two of its vertices.
8 marks
|
Asked in 2071