A Linear Algorithm for Computing Independence Polynomials of Trees

Ohr Kadrawi, Vadim E. Levit, Ron Yosef +1

An independent set in a graph is a set of pairwise non-adjacent vertices. Let $\alpha (G)$ denote the cardinality of a maximum independent set in the graph $G=(V,E)$. Gutman and Harar…