On the roots of the subtree polynomial
Combinatorics
2018-10-23 v1
Abstract
For a tree , the subtree polynomial of is the generating polynomial for the number of subtrees of . We show that the complex roots of the subtree polynomial are contained in the disk , and that is the only tree whose subtree polynomial has a root on the boundary. We also prove that the closure of the collection of all real roots of subtree polynomials contains the interval , while the intervals , , and are root-free.
Cite
@article{arxiv.1810.08655,
title = {On the roots of the subtree polynomial},
author = {Jason I. Brown and Lucas Mol},
journal= {arXiv preprint arXiv:1810.08655},
year = {2018}
}
Comments
16 pages, 3 figures, comments welcome