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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have