Acyclic polynomials of graphs
For each nonnegative integer $ i $, let $ a_i $ be the number of $ i $-subsets of $ V (G) $ that
induce an acyclic subgraph of a given graph $ G $. We define $ A (G, x)=\sum_ {i\geq 0} a_i …
induce an acyclic subgraph of a given graph $ G $. We define $ A (G, x)=\sum_ {i\geq 0} a_i …