Spanning forests, electrical networks, and a determinant identity
Date
2009
Authors
Teufl E.
Wagner S.
Journal Title
Journal ISSN
Volume Title
Publisher
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. © 2009 Discrete Mathematics and Theoretical Computer Science (DMTCS), Nancy, France.
Description
Keywords
Citation
FPSAC'09 - 21st International Conference on Formal Power Series and Algebraic Combinatorics
847
858
847
858