Chromatic polynomials of signed graphs with a balancing vertex
We study the zero-free chromatic polynomial $Z_Σ(q)$ of a signed graph $Σ$ and the characteristic polynomial $χ_Σ(q)=Z_Σ(q-1)$ of its associated hyperplane arrangement containing all coordinate hyperplanes. For a connected signed graph on $n\ge 2$ vertices with a balancing vertex, we prove the equivalence of the following four conditions: (i) $Z_Σ(q)$ is the chromatic polynomial of an ordinary graph; (ii) the numerator of $\sum_{q\ge 1}χ_Σ(q)t^q$, written with denominator $(1-t)^{n+1}$, has nonnegative coefficients; (iii) $Σ$ has a balanced block; and (iv) $χ_Σ(2)=0$. We also provide explicit counterexamples showing that neither the balancing-vertex assumption nor connectedness can be omitted.
Authors
- Akihiro Higashitani (ORCID: https://orcid.org/0000-0002-6267-8250)
- Masato Konoike
- Go Kamata
Publication Details
- Journal
- arXiv (Cornell University)
- Published
- 2026-11-12
- DOI
- https://doi.org/10.48550/arxiv.2611.16458
- Primary Topic
- Advanced Combinatorial Mathematics
- Type
- preprint