I have few questions , I need the solutions to verify my answer: 1)… I have few questions , I need the solutions to verify my answer: 1) L

I have few questions , I need the solutions to verify my answer: 1)… I have few questions , I need the solutions to verify my answer: 1) Let G be a connected graph. Show that G is a tree if and only if G ? e is disconnected for every e ? E(G).2) Let ?(G) denote the maximum degree of a vertex in a graph G. Prove that a tree T has at least ?(T) leaves.  Math Logic MATH 365 Share QuestionEmailCopy link