Discrete Structure - Old Questions
15. Prove that an undirected graph is a tree if there is a unique simple path between any two of its vertices.
4 marks
|
Asked in 2065