prove that for every connected graph G, if G has no cycles then for every pair of vertices a,b in G, there is only one path from a to b in G.
the contrapositive of this would be easier to prove but i'm not exactly sure how to do that..
prove that for every connected graph G, if G has no cycles then for every pair of vertices a,b in G, there is only one path from a to b in G.
the contrapositive of this would be easier to prove but i'm not exactly sure how to do that..