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 identifying some labeled...