If G is connected, then the number of edges of G has at least n-1 edges reeIf G is connected, then the number of edges of G has at least n-1 edges. Tree