On trees with real-rooted independence polynomial
From MaRDI portal
Publication:1800402
DOI10.1016/j.disc.2018.06.033zbMath1397.05082arXiv1703.05409OpenAlexW2606312473MaRDI QIDQ1800402
Publication date: 23 October 2018
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.05409
Graph polynomials (05C31) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (10)
Log-concavity of some independence polynomials via a partial ordering ⋮ Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction ⋮ Unimodality of independence polynomials of the cycle cover product of graphs ⋮ On real-rootedness of independence polynomials of rooted products of graphs ⋮ Zeros, chaotic ratios and the computational complexity of approximating the independence polynomial ⋮ A note on purely imaginary independence roots ⋮ Fisher zeros and correlation decay in the Ising model ⋮ Unimodality of independence polynomials of rooted products of graphs ⋮ On the independent set sequence of a tree ⋮ Contraction: a unified perspective of correlation decay and zero-freeness of 2-spin systems
Cites Work
- Clique cover products and unimodality of independence polynomials
- On the unimodality of independence polynomials of some graphs
- The roots of the independence polynomial of a clawfree graph
- The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma
- Counting independent sets up to the tree threshold
- Unimodality of the independence polynomials of some composite graphs
- The independent set sequence of some families of trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On trees with real-rooted independence polynomial