On the roots of Wiener polynomials of graphs

DOI10.1016/J.DISC.2018.05.014MaRDI QIDQ724845zbMATHOpenAlexFDO

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

Publication date 26 July 2018

Published in Discrete Mathematics (Search for Journal in Brave)

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)

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.

Recommendations

• On roots of Wiener polynomials of trees
• The Wiener polynomials of graphs under conglutinate operation
• The hyper-Wiener polynomial of graphs
• On the Wiener index of rooted product of graphs
• On the roots of Hosoya polynomial of a graph
• Roots of Ehrhart polynomials arising from graphs
• On the roots of domination polynomial of graphs
• The Wiener polynomial of the \(k\)th power graph
• The Wiener polynomial for the subdivision graph of certain classes of graphs
• The Wiener polynomial for the subdivision graphs

Cites work

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

Cited in

(5)

• Roots of Ehrhart polynomials arising from graphs
• On the zeros of the partial Hosoya polynomial of graphs
• On roots of Wiener polynomials of trees
• scientific article; zbMATH DE number 7540105 (Why is no real title available?)
• A survey of recent extremal results on the Wiener index of trees

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)