Trees and their properties
Graph theory · Mathematics
Study notes
Q: A tree has 10 vertices. How many edges? How many leaves at minimum? Edges: n-1 = 9. Leaves: every tree with ≥ 2 vertices has ≥ 2 leaves (prove: longest path's ends!). So at least 2 leaves. (A path has exactly 2; a star has 9!)