Discrete Structures - Old Questions
11. List any two applications of graph coloring theorem. Prove that "A tree with n vertices has n-1 edges"
5 marks
|
Asked in 2076