Search for question
Question

A forest is a graph each of whose connected components is a tree. (a) Prove that a graph is a forest if and only if it does not have any cycle. (b) Let G be a forest of k trees and n vertices, where n>k> 1. How many edgesdoes G have? What is the fewest number of edges that can be added in G inorder to obtain a tree?

Fig: 1

Fig: 2

Fig: 3