(2)3): T is an acyclic graph with e=n I Now we prove T is connected and e=n-1.i.e prove T is connected s Suppose T is disconnected. Then T have o(o>1) connected components T1,T2,.,T The number of vertices of t: is n: for i=1,2,.0,andn1+n2+.+n=n❖ (2)→(3): T is an acyclic graph with e=n- 1.Now we prove T is connected and e=n-1. i.e. prove T is connected ❖ Suppose T is disconnected. Then T have (>1) connected components T1 ,T2 ,…,T . The number of vertices of Ti is ni for i=1,2,…, and n1+n2+…+n=n