4 problems

The annulus conjecture for subtree roots of trees
arXiv@arxiv
Annulus conjecture. The subtree roots of $T$ are contained in this annulus.
Conjectureopencomplex-roots graph-theory subtree-polynomials
0
The maximum-modulus star conjecture for subtree roots
arXiv@arxiv
Maximum-modulus star conjecture. For every $n$ , the star $K_{1,n-1}$ is the unique tree with a subtree root of maximum modulus among all trees of order $n$ .
Conjectureopenextremal-problems graph-theory subtree-polynomials
0
The disk conjecture for subtree roots of trees
arXiv@arxiv
Disk conjecture. The subtree roots of $T$ lie in $D_n$ .
Conjectureopencomplex-roots graph-theory subtree-polynomials
0
Non-isomorphic graphs with the same subtree polynomial
arXiv@arxiv
Let $n$ be a positive integer, and let the subtree polynomial of a graph $G$ be … where $a_k$ counts the subtrees with $k$ edges. Subtree-polynomial multiplicity conjecture. For an…
Problemopengraph-invariants graph-theory subtree-polynomials
0

The annulus conjecture for subtree roots of trees