1. Assume that the graph haves an equal number of vertices and edges. Show that the graph should contain at least one cycle. Is this graph necessarily a cycle graphh? (Show by induction).
2. Describe that the average degree in a tree is always less than 2. More specifically, express this average as the function of n, the number of vertices. (use the degree theorem)