On the number of nonisomorphic subtrees of a tree
classification
🧮 math.CO
keywords
nonisomorphicsubtreestreenumberrootedanalogousbestbound
read the original abstract
We show that a tree of order $n$ has at most $O(5^{n/4})$ nonisomorphic subtrees, and that this bound is best possible. We also prove an analogous result for the number of nonisomorphic rooted subtrees of a rooted tree.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.