1 research outputs found
On roots of Wiener polynomials of trees
The \emph{Wiener polynomial} of a connected graph is the polynomial
where is the diameter of , and
is the number of pairs of vertices at distance from each other. We
examine the roots of Wiener polynomials of trees. We prove that the collection
of real Wiener roots of trees is dense in , and the collection of
complex Wiener roots of trees is dense in . We also prove that the
maximum modulus among all Wiener roots of trees of order is between
and , and we determine the unique tree that achieves the maximum
for . Finally, we find trees of arbitrarily large diameter whose
Wiener roots are all real