Factorizations of some weighted spanning tree enumerators

Martin, Jeremy L.; Reiner, Victor

dc.contributor.author	Martin, Jeremy L.
dc.contributor.author	Reiner, Victor
dc.date.accessioned	2010-06-17T20:40:44Z
dc.date.available	2010-06-17T20:40:44Z
dc.date.issued	2003-11
dc.identifier.citation	Factorizations of some weighted spanning tree enumerators (with Victor Reiner), Journal of Combinatorial Theory, Series A 104, no. 2 (2003), 287--300.
dc.identifier.uri	http://hdl.handle.net/1808/6354
dc.description	This is the author's accepted manuscript.
dc.description.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.
dc.publisher	Elsevier
dc.relation.hasversion	http://arxiv.org/abs/math.CO/0302213
dc.title	Factorizations of some weighted spanning tree enumerators
dc.type	Article
kusw.kuauthor	Martin, Jeremy L.
kusw.kudepartment	Mathematics
kusw.oastatus	fullparticipation
dc.identifier.doi	10.1016/j.jcta.2003.08.003
kusw.oaversion	Scholarly/refereed, author accepted manuscript
kusw.oapolicy	This item meets KU Open Access policy criteria.
dc.rights.accessrights	openAccess

Files in this item

Name:: spantree.pdf
Size:: 384.7Kb
Format:: PDF

View/Open

This item appears in the following Collection(s)

The University of Kansas prohibits discrimination on the basis of race, color, ethnicity, religion, sex, national origin, age, ancestry, disability, status as a veteran, sexual orientation, marital status, parental status, gender identity, gender expression and genetic information in the University’s programs and activities. The following person has been designated to handle inquiries regarding the non-discrimination policies: Director of the Office of Institutional Opportunity and Access, IOA@ku.edu, 1246 W. Campus Road, Room 153A, Lawrence, KS, 66045, (785)864-6414, 711 TTY.