On roots of Wiener polynomials of trees
Danielle Wang

TL;DR
This paper studies the roots of Wiener polynomials of trees, showing their roots are dense in the complex plane and real roots can be found for trees with arbitrarily large diameter, with specific bounds on maximum modulus.
Contribution
It proves the density of Wiener roots in the complex plane and real line, determines the tree with maximum Wiener root modulus for large n, and constructs trees with all real roots and large diameter.
Findings
Real Wiener roots are dense in (-∞, 0]
Complex Wiener roots are dense in ℂ
Maximum Wiener root modulus for large n is between 2n-15 and 2n-16
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Synthesis and Properties of Aromatic Compounds · Cholinesterase and Neurodegenerative Diseases
