A Bijective Proof For Forest Reciprocity Theorem
arXiv:0909.2508
Abstract
In this paper, we study the graph polynomial that counts spanning rooted forests f_g of a given graph. This polynomial has a remarkable reciprocity property. We give a new bijective proof for this theorem which has Prufer coding as a special case.
9 pages