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...
Tallennettuna:
| Päätekijät: | , |
|---|---|
| Aineistotyyppi: | Artigo |
| Kieli: | Inglês |
| Julkaistu: |
Discrete Mathematics & Theoretical Computer Science
2009-01-01
|
| Sarja: | Discrete Mathematics & Theoretical Computer Science |
| Aiheet: | |
| Linkit: | https://dmtcs.episciences.org/2699/pdf |
| Tagit: |
Ei tageja, Lisää ensimmäinen tagi!
|