(a) Prove that a graph with n vertices, n-1 edges and no cycles is co…
Previous year question for Discrete Mathematics.
Question
(a) Prove that a graph with n vertices, n-1 edges and no cycles is connected.
(b) Define cut set. Prove that every cycle in a connected graph G has even no. of edges in common with any cut set of G.
- Year: 2022
- Subject: Discrete Mathematics