- 98-104 Ruelle D.
- Counting unbranched subgraphs.
(9K, plain TeX)
Mar 1, 98
-
Abstract ,
Paper (src),
View paper
(auto. generated ps),
Index
of related papers
-
Abstract. Given an arbitrary finite graph, the polynomial $Q(z)$ $=\sum_{F\in {\cal U}}z^{{\rm card}F}$ associates a weight $z^{{\rm card}F}$ to each unbranched subgraph $F$ of length ${\rm card}F$. We show that all the zeros of $Q$ have negative
real part.
- Files:
98-104.txt