On roots of Wiener polynomials of trees

Abstract: The emph{Wiener polynomial} of a connected graph

G

is the polynomial

W (G; x) = s u m_{i = 1}^{D (G)} d_{i} (G) x^{i}

where

D (G)

is the diameter of

G

, and

d_{i} (G)

is the number of pairs of vertices at distance

i

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

(- i n f t y, 0]

, and the collection of complex Wiener roots of trees is dense in

m a t h b b C

. We also prove that the maximum modulus among all Wiener roots of trees of order

n g e 31

is between

2 n - 15

and

2 n - 16

, and we determine the unique tree that achieves the maximum for

n g e 31

. Finally, we find trees of arbitrarily large diameter whose Wiener roots are all real.

Recommendations

Cites Work

Cited In (5)

This page was built for publication: On roots of Wiener polynomials of trees