Discrete Structure - Old Questions
15. Prove that “a simple graph is connected if and only if it has a spanning tree”.
4 marks
|
Asked in 2070