 The similar problem of counting all the subtrees regardless of size has been shown to be #P-complete in the general case ().Counting the number of unlabeled free trees is a harder problem.No closed formula for the number "t"("n") of trees with "n" vertices up to graph isomorphism is known.