On the roots of the subtree polynomial

Abstract

For a tree T, the subtree polynomial of T is the generating polynomial for the number of subtrees of T. We show that the complex roots of the subtree polynomial are contained in the disk \z∈C\ |z|≤ 1+[3]3\, and that K1,3 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 [-2,-1], while the intervals (∞,-1-[3]3), [-1,0), and (0,∞) are root-free.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…