Roots of Independence Polynomials of Well Covered Graphs
By Jason I. Brown, Karl Dilcher, R. Nowakowski. 2000
100 citations recorded by the source corpus.
Subfields: Discrete Mathematics and Combinatorics, Geometry and Topology, Mathematical Physics
View Paper: https://www.semanticscholar.org/paper/f0788a6cd289668f295fcb8aa1de04944beda2f2
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Geometry and Topology
In Mathematical Physics
Citations in the corpus
- The independence polynomial of a graph - a survey (2005, background): “Brown and Nowakowski investigated the average independence polynomial AIn (x) = 2−( n 2) ∑ |V (G)|=n I (G; x) , where the average is taken over all independence polynomials of graphs of order n.”
- On the Location of Roots of Independence Polynomials (2004, background): “The graphs Lβ were considered in [6], where the following was shown.”
- The Repulsive Lattice Gas, the Independent-Set Polynomial, and the Lovász Local Lemma (2003, background): “Traditionally the independent-set polynomial is defined as a univariate polynomial ZG(w) in which wx is set equal to the same value w for all vertices x [4, 41, 42, 56, 51, 52, 53, 63, 27, 28, 64, 77].”