(a) Prove that every connected graph has at least one spanning tree.…
Previous year question for Discrete Mathematics.
Question
(a) Prove that every connected graph has at least one spanning tree.
(b) Prove that every circuit has an even number of edges in common with every cutset.
(c) Give an example of a graph that has :
(i) Both a Hamiltonian circuit and Euler circuit.
(ii) Euler circuit but not Hamiltonian circuit.
- Year: 2018
- Subject: Discrete Mathematics