retagged by
3,588 views

1 Answer

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.
selected by
Answer:

Related questions

1 votes
1 votes
4 answers
2
go_editor asked Jul 26, 2016
3,912 views
A graph is non-planar if and only if it contains a subgraph homomorphic to$K_{3,2} \text{ or } K_5$$K_{3,3} \text{ or } K_6$$K_{3,3} \text{ or } K_5$$K_{2,3} \text{ or } ...
1 votes
1 votes
1 answer
3
go_editor asked Jul 26, 2016
2,870 views
Linux operating system usesAffinity schedulingFair Preemptive SchedulingHand ShakingHighest Penalty Ratio Next