Question: discrete math help with number 2 i gave the first...
Discrete Math: Help with number 2? I gave the first question for context
An edge e of a connected graph is a bridge if the deletion of e disconnects the graph into two pieces.
A theorem of graph theory states: An edge e of a graph G is a bridge if and only if e does not lie on any cycle of G.
Give two statements that would have to be proved to prove this theorem.
Give the contrapositive of each statement in a)
2. Give two reasons why the following sequence cannot be the degree sequence of a graph