Some Applications of Wagner's Weighted Subgraph Counting Polynomial
2021
We use Wagner's weighted subgraph counting polynomial to prove that the partition function of the anti-ferromagnetic Ising model on line graphs is real rooted and to prove that roots of the edge cover polynomial have length at most $4$. We moreover discuss how our results relate to efficient algorithms for approximately computing evaluations of these polynomials.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
0
References
1
Citations
NaN
KQI