A Bijective Proof For Forest Reciprocity Theorem
classification
🧮 math.CO
keywords
bijectivegraphpolynomialproofreciprocitytheoremcasecoding
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.