Before revision: Wang Algebra and the Spanning Trees of a Graph
After revision: The Wang Rules for Finding all Spanning Trees of a Graph GFor each node write the sum of all the edge-labels that meet that node.Leave out one node and take the product of the sums of labels for all the remaining nodes.Expand the product in 2. using the Wang algebra.The terms in the sum of the expansion obtained in 3. are in 1-1 correspondence with the spanning trees in the graph.Wang Algebra and the Spanning Trees of a Graph