Vertex and graphs . prove trees.

Question

Can anyone tell me how to prove that every tree with at least 1 edge has at least 2 leaves? Im currently studyinng proof of trees.

Suppose the graph is finite. Then consider the longest path in the graph between any two nodes. — Wuestenfux, May 27 '17 at 12:04

score 0 · Answer 1 · answered May 27 '17 at 12:01

0

The two (distinct!) endpoints of a maximal path are leaves.

answered May 27 '17 at 12:01

Hagen von Eitzen

is there a way to answer this in a professional way? – studymaths May 27 '17 at 12:04

1 Answers1