98-297 David Ruelle

Zeros of graph-counting polynomials (39K, Plain TeX) Apr 24, 98

Abstract , Paper (src), View paper (auto. generated ps), Index of related papers

Abstract. Given a finite graph $E$ we define a family ${\cal A}$ of subgraphs $F$ by restricting the number of edges of $F$ with endpoint at any vertex of $E$. Defining $Q_{\cal A}(z)=\sum_{F\in {\cal U}}z^{{\rm card}F}$, we can in many cases give precise information on the location of zeros of $Q_{\cal A}(z)$ (zeros all real negative, all imaginary, etc.). Extensions of these results to weighted and infinite graphs are given.

Files: 98-297.tex