A Bijective Proof For Forest Reciprocity Theorem
Combinatorics
2009-09-15 v1
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.
Cite
@article{arxiv.0909.2508,
title = {A Bijective Proof For Forest Reciprocity Theorem},
author = {ShinnYih Huang},
journal= {arXiv preprint arXiv:0909.2508},
year = {2009}
}
Comments
9 pages