Metraipolis › archive › dc_b7c4441ef58d

Stability of independence polynomials of spiders — arXiv:2609.04694

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.04694
License (as archived)
CC0-1.0
Archived
2026-10-16T23:20:53.262Z
SHA-256 of the archived text
3136b4c0918f697756b3711ad5c0d7e20338c72883cc658c51d1aac006646ce6
Stable URL of this page
https://metraipolis.com/documento/dc_b7c4441ef58d

How to cite

Stability of independence polynomials of spiders — arXiv:2609.04694 — arXiv (en), https://arxiv.org/abs/2609.04694 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b7c4441ef58d (Metraipolis archive dc_b7c4441ef58d, sha256 3136b4c0918f697756b3711ad5c0d7e20338c72883cc658c51d1aac006646ce6)
BibTeX
@misc{dcb7c4441ef58d,
  title = {Stability of independence polynomials of spiders — arXiv:2609.04694},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.04694},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b7c4441ef58d; sha256 3136b4c0918f697756b3711ad5c0d7e20338c72883cc658c51d1aac006646ce6},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.04694. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

For a graph $G$, let $i_k(G)$ denote the number of independent sets of cardinality $k$, and let \[ I(G,z)=\sum_{k\ge0} i_k(G)z^k \] be its independence polynomial. Following Brown and Cameron \cite{BrownCameron2018}, a graph is called stable if all zeros of its independence polynomial lie in the closed left half-plane. They proved that every star is stable, but also constructed nonstable trees. They then asked for a characterization of stable trees. In this paper, we extend and strengthen their result by proving that every spider, obtained from a star by arbitrary and possibly nonuniform subdivisions of its edges, has all its independence roots in the open left half-plane. Hence, every spider is stable.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-07 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.04694 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T23:03:13.242Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-07?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).