Factorizations of some weighted spanning tree enumerators

Jeremy L. Martin, Victor Reiner

Research output: Contribution to journalArticle

11 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)287-300
Number of pages14
JournalJournal of Combinatorial Theory. Series A
Volume104
Issue number2
DOIs
StatePublished - Nov 2003

Keywords

  • Graph Laplacian
  • Matrix-tree theorem
  • Spanning tree

Fingerprint Dive into the research topics of 'Factorizations of some weighted spanning tree enumerators'. Together they form a unique fingerprint.

  • Cite this