Mathematics > Combinatorics
[Submitted on 1 Sep 2024
(v1)
, last revised 3 Sep 2025 (this version, v2)]
Title: Log-concavity of the independence polynomials of $\mathbf{W}_{p}$ graphs
Title: $\mathbf{W}_{p}$图的独立多项式的对数凹性
Abstract: Let $G$ be a graph of order $n$. For a positive integer $p$, $G$ is said to be a $\mathbf{W}_{p}$ graph if $n\geq p$ and every $p$ pairwise disjoint independent sets of $G$ are contained within $p$ pairwise disjoint maximum independent sets. In this paper, we establish that every connected $\mathbf{W}_{p}$ graph $G$ is $p$-quasi-regularizable if and only if $n\geq(p+1)\cdot\alpha$, where $\alpha$ is the independence number of $G$ and $p\neq2$. This finding ensures that the independence polynomial of a connected $\mathbf{W}_{p}$ graph $G$ is log-concave whenever $(p+1)\cdot\alpha\leq n\leq p\cdot\alpha+2\sqrt{p\cdot\alpha+p}$ and $\frac{\alpha^{2}}{4\left( \alpha+1\right) }\leq p$, or $p\cdot\alpha+2\sqrt{p\cdot\alpha+p}<n\leq \frac{\left( \alpha^{2}+1\right) \cdot p+\left( \alpha-1\right) ^{2}}{\alpha-1}$ and $\frac{\alpha\left( \alpha-1\right) }{\alpha+1}\leq p$. Moreover, the clique corona graph $G\circ K_{p}$ serves as an example of the $\mathbf{W}_{p}$ graph class. We further demonstrate that the independence polynomial of $G\circ K_{p}$ is always log-concave for sufficiently large $p$. Keywords: very well-covered graph; quasi-regularizable graph; corona graph; $\mathbf{W}_{p}$ graph; independence polynomial; log-concavity.
Submission history
From: Vadim E. Levit [view email][v1] Sun, 1 Sep 2024 20:00:45 UTC (14 KB)
[v2] Wed, 3 Sep 2025 17:50:12 UTC (21 KB)
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender
(What is IArxiv?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.