Exercise Theorems
1. Complete graph on n vertices has n(n-1)/2 edges
2. A graph is minimally connected if and only if it is a tree.
3. In a tree there are at least two pendant vertices
4. The distance between vertices of a connected graph is metric .
5. Every connected graph has at least one spanning tree.
