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