Unit II
Definition of a tree
theorem
1. there is only one path between every pair of vertices in a tree
2. if there is only one path between every pair of vertices then G is a tree
3. a tree with n vertices has n-1 Edges
4. a connected graph with n vertices and n-1 Edges is a tree
Page 32,33,34,35
