Skip to Main content Skip to Navigation
Conference papers

Spanning forests, electrical networks, and a determinant identity

Abstract : We aim to generalize a theorem on the number of rooted spanning forests of a highly symmetric graph to the case of asymmetric graphs. We show that this can be achieved by means of an identity between the minor determinants of a Laplace matrix, for which we provide two different (combinatorial as well as algebraic) proofs in the simplest case. Furthermore, we discuss the connections to electrical networks and the enumeration of spanning trees in sequences of self-similar graphs.
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Thursday, August 20, 2015 - 11:07:18 AM
Last modification on : Tuesday, December 17, 2019 - 9:30:02 AM
Long-term archiving on: : Wednesday, April 26, 2017 - 9:56:18 AM


Publisher files allowed on an open archive




Elmar Teufl, Stephan Wagner. Spanning forests, electrical networks, and a determinant identity. 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), 2009, Hagenberg, Austria. pp.847-858, ⟨10.46298/dmtcs.2699⟩. ⟨hal-01185391⟩



Record views


Files downloads