On the roots of Wiener polynomials of graphs

DOI10.1016/J.DISC.2018.05.014zbMATH Open1392.05057arXiv1801.03985OpenAlexW2963760667MaRDI QIDQ724845FDOQ724845

L. A. S. Mól, Ortrud R. Oellermann, Jason I. Brown

Publication date: 26 July 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: The Wiener polynomial of a connected graph $G$ is defined as $W(G;x)=sum{x}^{d(u,v)}$, where $d(u,v)$ denotes the distance between $u$ and $v$, and the sum is taken over all unordered pairs of distinct vertices of $G$. We examine the nature and location of the roots of Wiener polynomials of graphs, and in particular trees. We show that while the maximum modulus among all roots of Wiener polynomials of graphs of order $n$ is $$, the maximum modulus among all roots of Wiener polynomials of trees of order $n$ grows linearly in $n$. We prove that the closure of the collection of real roots of Wiener polynomials of all graphs is precisely $(-infty,0]$, while in the case of trees, it contains $(-infty,-1]$. Finally, we demonstrate that the imaginary parts and (positive) real parts of roots of Wiener polynomials can be arbitrarily large.

Full work available at URL: https://arxiv.org/abs/1801.03985

zbMATH Keywords

Wiener indexpolynomial rootsgraph polynomialsdistance in graphsWiener polynomial

Mathematics Subject Classification ID

Graph polynomials (05C31) Distance in graphs (05C12) Connectivity (05C40)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Theory of monomer-dimer systems
• Bounds on the complex zeros of (di)chromatic polynomials and Potts-model partition functions
• The Zero-Free Intervals for Chromatic Polynomials of Graphs
• On the location of roots of independence polynomials
• Average independence polynomials
• The behavior of Wiener indices and polynomials of graphs under five graph decorations
• The roots of the independence polynomial of a clawfree graph
• On some counting polynomials in chemistry
• A Zero-Free Interval for Chromatic Polynomials of Graphs
• Roots of the Reliability Polynomials
• A dense set of chromatic roots which is closed under multiplication by positive integers
• Bounding the roots of independence polynomials.
• The characteristic polynomial of a graph
• The expected number of pairs of connected nodes: Pair-connected reliability
• On the roots of all-terminal reliability polynomials
• Network Resilience

Cited In (5)

• A survey of recent extremal results on the Wiener index of trees
• Roots of Ehrhart polynomials arising from graphs
• Title not available (Why is that?)
• On the zeros of the partial Hosoya polynomial of graphs
• On roots of Wiener polynomials of trees

Recommendations

• On the roots of domination polynomial of graphs 👍 👎
• Roots of Ehrhart polynomials arising from graphs 👍 👎
• On roots of Wiener polynomials of trees 👍 👎
• The Wiener polynomial of the \(k\)th power graph 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q724845)