On the roots of Wiener polynomials of graphs
From MaRDI portal
Publication:724845
DOI10.1016/j.disc.2018.05.014zbMath1392.05057arXiv1801.03985OpenAlexW2963760667MaRDI QIDQ724845
Ortrud R. Oellermann, Jason I. Brown, 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
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A dense set of chromatic roots which is closed under multiplication by positive integers
- On the location of roots of independence polynomials
- The roots of the independence polynomial of a clawfree graph
- On some counting polynomials in chemistry
- The expected number of pairs of connected nodes: Pair-connected reliability
- Average independence polynomials
- The behavior of Wiener indices and polynomials of graphs under five graph decorations
- On the roots of all-terminal reliability polynomials
- The characteristic polynomial of a graph
- Theory of monomer-dimer systems
- Bounds on the Complex Zeros of (Di)Chromatic Polynomials and Potts-Model Partition Functions
- Network Resilience
- Roots of the Reliability Polynomials
- A Zero-Free Interval for Chromatic Polynomials of Graphs
- The Zero-Free Intervals for Chromatic Polynomials of Graphs