f_G of disjoint union

Tags: #theorem

Statement

Let G,H be two graphs on disjoint vertex sets. Then,

fGH=xfG(x)fH(x)

where fG is defined here

Proof

Note that a spanning tree of (GH)+ consists of pairs of spanning trees of G and H. We multiply by x as for each graph, the degree of 0 will be

degTG(0)+degTH(0)1=1+degTG(0)1+degTH(0)1