A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Note on the Smallest Root of the Independence Polynomial
2012
Combinatorics, probability & computing
Preserved Fulltext
One can define the independence polynomial of a graph G as follows. Let i k (G) denote the number of independent sets of size k of G, where i 0 (G) = 1. Then the independence polynomial of G is
doi:10.1017/s0963548312000302
fatcat:iovbtk6u5zbc5ombaxq265fn4e