Spanning forests, electrical networks, and a determinant identity

Simple item page
dc.contributor.authorTeufl E.
dc.contributor.authorWagner S.
dc.date.accessioned2012-05-17T09:01:02Z
dc.date.available2012-05-17T09:01:02Z
dc.date.issued2009
dc.description.abstractWe 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.
dc.identifier.citationFPSAC'09 - 21st International Conference on Formal Power Series and Algebraic Combinatorics
dc.identifier.citation847
dc.identifier.citation858
dc.identifier.urihttp://hdl.handle.net/10019.1/21108
dc.titleSpanning forests, electrical networks, and a determinant identity
dc.typeConference Paper
Files
Collections
Stellenbosch University - Scopus Publications