Spanning forests, electrical networks, and a determinant identity

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 wel...

Descripció completa

Dades bibliogràfiques

Autors principals:	Elmar Teufl, Stephan Wagner
Format:	Artigo
Idioma:	Inglês
Publicat:	Discrete Mathematics & Theoretical Computer Science 2009-01-01
Col·lecció:	Discrete Mathematics & Theoretical Computer Science
Matèries:	spanning forest electrical network laplace matrix determinant identity [math.math-co] mathematics [math]/combinatorics [math.co] [info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Accés en línia:	https://dmtcs.episciences.org/2699/pdf
Etiquetes:	Afegir etiqueta Sense etiquetes, Sigues el primer a etiquetar aquest registre!