5 votes 5 votes How many edges are there in a forest of t-trees containing a total of n vertices ? n + t n – t n ∗ t nt Graph Theory ugcnetcse-dec2013-paper2 data-structures tree + – Shimpy Goyal asked Jun 26, 2015 • retagged Nov 25, 2017 by Devshree Dubey Shimpy Goyal 3.7k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 11 votes 11 votes In each tree we have k-1 edges for k vertices. So, for t trees with total n vertices (all trees are disconnected in a forest) we would have n-t edges. Arjun answered Jun 26, 2015 • selected Dec 3, 2015 by Akash Kanase Arjun comment Share Follow See 1 comment See all 1 1 comment reply rish1602 commented Jun 15, 2021 reply Follow Share @ Arjun @ Akash Kanase here if each tree has Vi vertices then V1 + V2+ V3+ …..+Vt = n (E1 – 1) + (E2 – 1) + (E3 – 1)+ . . . . . .( Et – 1) = n as max edges in tree= V+1 (E1 + E2 + E3+ ...+Et ) – (1+1+1+1…...+1) = n E – t = n E = n+t Sir, where am I wrong ? 0 votes 0 votes Please log in or register to add a comment.