Log-concavity of the independence polynomials of $\mathbf{W}_{p}$ graphs
Do Trong Hoang, Vadim E. Levit, Eugen Mandrescu, My Hanh Pham

TL;DR
This paper investigates the log-concavity of independence polynomials in a special class of graphs called $ extbf{W}_p$ graphs, establishing conditions under which these polynomials are log-concave and providing examples like the clique corona graph.
Contribution
It introduces the class of $ extbf{W}_p$ graphs, characterizes when their independence polynomials are log-concave, and shows that the clique corona graph always has a log-concave independence polynomial for large $p$.
Findings
Connected $ extbf{W}_p$ graphs are $p$-quasi-regularizable under certain conditions.
Independence polynomials of $ extbf{W}_p$ graphs are log-concave within specific parameter ranges.
Clique corona graphs $G igcirc K_p$ have always log-concave independence polynomials for sufficiently large $p$.
Abstract
Let be a graph of order . For a positive integer , is said to be a graph if and every pairwise disjoint independent sets of are contained within pairwise disjoint maximum independent sets. In this paper, we establish that every connected graph is -quasi-regularizable if and only if , where is the independence number of and . This finding ensures that the independence polynomial of a connected graph is log-concave whenever and , or and . Moreover, the clique…
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.
Taxonomy
TopicsGraph theory and applications · Advanced Combinatorial Mathematics · Topological and Geometric Data Analysis
