Factorizations of some weighted spanning tree enumerators
classification
🧮 math.CO
keywords
enumeratorsfactorizationsspanningtreeweightedcartesiancombinecomplete
read the original abstract
We give factorizations for weighted spanning tree enumerators of Cartesian products of complete graphs, keeping track of fine weights related to degree sequences and edge directions. Our methods combine Kirchhoff's Matrix-Tree Theorem with the technique of identification of factors.
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.