arXiv (All)
open access
Zeros of the independence polynomial on recursive sequences of graphs
We study the hard-core model on recursively defined sequences $(G_n)_{n\geq0}$ of graphs with a fixed number $k\geq 1$ of labeled vertices in each graph. The next graph in the sequence is constructed by taking a fixed number $m\geq 2$ of copies of the previous graph, connecting these copies by ident
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Combinatorial Theory: Introduction to Graph Theory, Extremal and Enumerative Combinatorics#66909
- Lorentzian polynomials and log-concavity of the independence polynomials of graphs#1141872
- Logarithmic basis number of graphs and regular matroids#1084361
- Common pairs of graphs#628826
- Biplanar graphs with independence number two are 9-colorable#1064646
Record · ID 1129703
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive