Geodesic
Spanning forests, electrical networks, and a determinant identity
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AK, 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), DMTCS Proceedings vol. AK, 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009) (2009).

Voir la notice de l'article provenant de la source Episciences

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. 
@article{DMTCS_2009_special_256_a21,
     author = {Teufl, Elmar and Wagner, Stephan},
     title = {Spanning forests, electrical networks, and a determinant identity},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AK, 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009)},
     year = {2009},
     doi = {10.46298/dmtcs.2699},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2699/}
}
TY  - JOUR
AU  - Teufl, Elmar
AU  - Wagner, Stephan
TI  - Spanning forests, electrical networks, and a determinant identity
JO  - Discrete mathematics & theoretical computer science
PY  - 2009
VL  - DMTCS Proceedings vol. AK, 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009)
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2699/
DO  - 10.46298/dmtcs.2699
LA  - en
ID  - DMTCS_2009_special_256_a21
ER  - 
%0 Journal Article
%A Teufl, Elmar
%A Wagner, Stephan
%T Spanning forests, electrical networks, and a determinant identity
%J Discrete mathematics & theoretical computer science
%D 2009
%V DMTCS Proceedings vol. AK, 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009)
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2699/
%R 10.46298/dmtcs.2699
%G en
%F DMTCS_2009_special_256_a21
Teufl, Elmar; Wagner, Stephan. Spanning forests, electrical networks, and a determinant identity. Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AK, 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), DMTCS Proceedings vol. AK, 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009) (2009). doi : 10.46298/dmtcs.2699. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2699/

Cité par Sources :