Select a result to preview
Tags: #theorem
Let G,H be two graphs on disjoint vertex sets. Then,
where fG is defined here
Note that a spanning tree of (G⊔H)+ consists of pairs of spanning trees of G and H. We multiply by x as for each graph, the degree of 0 will be