Recent posts tagged pgee-2021

1
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.
To see more, click for the full list of questions or popular tags.