(a) What is Traveling - Salesman Problem? (b) Prove that every connec…
Previous year question for Discrete Mathematics.
Question
(a) What is Traveling - Salesman Problem?
(b) Prove that every connected graph has at least one spanning tree.
(c) Prove that any connected graph with n vertices and $n - 1$ edges is a tree.
- Year: 2018
- Subject: Discrete Mathematics