On the unimodality of independence polynomials of some graphs
Yi Wang, Bao-Xuan Zhu

TL;DR
This paper investigates the unimodality, log-concavity, and zero distribution of independence polynomials in graphs, providing recurrence relations, factorizations, and resolving some existing conjectures.
Contribution
It introduces new recurrence relations and factorizations for independence polynomials, settling several open unimodality conjectures for specific graph classes.
Findings
Established recurrence relations for independence polynomials
Provided factorizations for certain graph classes
Resolved some open unimodality conjectures
Abstract
In this paper we study unimodality problems for the independence polynomial of a graph, including unimodality, log-concavity and reality of zeros. We establish recurrence relations and give factorizations of independence polynomials for certain classes of graphs. As applications we settle some unimodality conjectures and problems.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
