Around matrix-tree theorem
2006 (English)In: Mathematical Research Letters, ISSN 1073-2780, Math. Res. Lett., Vol. 13, no 5--6, 761-774 p.Article in journal (Refereed) Published
Generalizing the classical matrix-tree theorem we provide a formula counting subgraphs of a given graph with a fixed 2-core. We use this generalization to obtain an analog of the matrix-tree theorem for the root system Dn (the classical theorem corresponds to the An-case). Several byproducts of the developed technique, such as a new formula for a specialization of the multivariate Tutte polynomial, are of independent interest.
Place, publisher, year, edition, pages
2006. Vol. 13, no 5--6, 761-774 p.
Tutte polynomial; matrix-tree theorem; subgraph count
IdentifiersURN: urn:nbn:se:su:diva-20603OAI: oai:DiVA.org:su-20603DiVA: diva2:187129