Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > math > arXiv:2409.00827

Help | Advanced Search

Mathematics > Combinatorics

arXiv:2409.00827 (math)
[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}$图的独立多项式的对数凹性

Authors:Do Trong Hoang, Vadim E. Levit, Eugen Mandrescu, My Hanh Pham
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.
Abstract: 设$G$是一个阶为$n$的图。 对于正整数$p$,如果$n\geq p$且每个$p$两两不相交的独立集的$G$都包含在$p$两两不相交的最大独立集中,则称$G$是一个$\mathbf{W}_{p}$图。 在本文中,我们证明每个连通的$\mathbf{W}_{p}$图$G$是$p$-准正则可化当且仅当$n\geq(p+1)\cdot\alpha$,其中$\alpha$是$G$的独立数,且$p\neq2$。 这一发现确保了当$(p+1)\cdot\alpha\leq n\leq p\cdot\alpha+2\sqrt{p\cdot\alpha+p}$且$\frac{\alpha^{2}}{4\left( \alpha+1\right) }\leq p$,或者$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}$且$\frac{\alpha\left( \alpha-1\right) }{\alpha+1}\leq p$时,连通的$\mathbf{W}_{p}$图$G$的独立多项式是log-凹的。 此外,团冠图$G\circ K_{p}$是$\mathbf{W}_{p}$图类的一个例子。 我们进一步证明,对于足够大的$p$,$G\circ K_{p}$的独立多项式始终是log-凹的。 关键词:非常良好覆盖图;准正则可化图;冠图;$\mathbf{W}_{p}$图;独立多项式;log-凹性。
Comments: 16 pages, 2 figures
Subjects: Combinatorics (math.CO) ; Discrete Mathematics (cs.DM)
MSC classes: 05C31, 05C69 (Primary) 05C05, 05C48 (Secondary)
ACM classes: G.2.1; G.2.2
Cite as: arXiv:2409.00827 [math.CO]
  (or arXiv:2409.00827v2 [math.CO] for this version)
  https://doi.org/10.48550/arXiv.2409.00827
arXiv-issued DOI via DataCite

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)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
view license
Current browse context:
math.CO
< prev   |   next >
new | recent | 2024-09
Change to browse by:
cs
cs.DM
math

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

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

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

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.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号