Date of Award
The independence polynomial of a graph is a polynomial whose coefficients number the independent sets of each size in that graph. This paper looks into methods of obtaining these polynomials for certain classes of graphs which prove too large to easily find the polynomial by traditional methods.
Broom, Jonathan, "Independence Polynomials and Extended Vertex Reduction" (2014). Honors Theses. 470.