Factorizations of some weighted spanning tree enumerators

Jeremy L. Martin; Victor Reiner

doi:10.1016/j.jcta.2003.08.003

Factorizations of some weighted spanning tree enumerators

Jeremy L. Martin, Victor Reiner

Mathematics

Research output: Contribution to journal › Article › peer-review

14 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 language	English (US)
Pages (from-to)	287-300
Number of pages	14
Journal	Journal of Combinatorial Theory. Series A
Volume	104
Issue number	2
DOIs	https://doi.org/10.1016/j.jcta.2003.08.003
State	Published - Nov 2003

Bibliographical note

Funding Information:
$J.L.M. was supported by NSF Postdoctoral F ellowship. V.R. was supported by NSF Grant DMS-9877047. E-mail addresses: martin@math.umn.edu (J.L. Martin), reiner@math.umn.edu (V. Reiner).

Keywords

Graph Laplacian
Matrix-tree theorem
Spanning tree

Access

10.1016/j.jcta.2003.08.003

OpenUrl availability

Full text

Cite this

@article{b625273caab1470093afe4562de5cb73,

title = "Factorizations of some weighted spanning tree enumerators",

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.",

keywords = "Graph Laplacian, Matrix-tree theorem, Spanning tree",

author = "Martin, {Jeremy L.} and Victor Reiner",

note = "Funding Information: $J.L.M. was supported by NSF Postdoctoral F ellowship. V.R. was supported by NSF Grant DMS-9877047. E-mail addresses: martin@math.umn.edu (J.L. Martin), reiner@math.umn.edu (V. Reiner).",

year = "2003",

month = nov,

doi = "10.1016/j.jcta.2003.08.003",

language = "English (US)",

volume = "104",

pages = "287--300",

journal = "Journal of Combinatorial Theory. Series A",

issn = "0097-3165",

publisher = "Academic Press Inc.",

number = "2",

}

TY - JOUR

T1 - Factorizations of some weighted spanning tree enumerators

AU - Martin, Jeremy L.

AU - Reiner, Victor

N1 - Funding Information: $J.L.M. was supported by NSF Postdoctoral F ellowship. V.R. was supported by NSF Grant DMS-9877047. E-mail addresses: martin@math.umn.edu (J.L. Martin), reiner@math.umn.edu (V. Reiner).

PY - 2003/11

Y1 - 2003/11

N2 - 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.

AB - 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.

KW - Graph Laplacian

KW - Matrix-tree theorem

KW - Spanning tree

UR - http://www.scopus.com/inward/record.url?scp=0346273077&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0346273077&partnerID=8YFLogxK

U2 - 10.1016/j.jcta.2003.08.003

DO - 10.1016/j.jcta.2003.08.003

M3 - Article

AN - SCOPUS:0346273077

SN - 0097-3165

VL - 104

SP - 287

EP - 300

JO - Journal of Combinatorial Theory. Series A

JF - Journal of Combinatorial Theory. Series A

IS - 2

ER -

Factorizations of some weighted spanning tree enumerators

Abstract

Bibliographical note

Keywords

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this