DOAJ Open Access 2009

Spanning forests, electrical networks, and a determinant identity

Elmar Teufl Stephan Wagner

Lihat Sumber DOI

Abstrak

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.

Topik & Kata Kunci

Mathematics

Penulis (2)

Elmar Teufl

Stephan Wagner

Format Sitasi

APA MLA BibTeX

Teufl, E., Wagner, S. (2009). Spanning forests, electrical networks, and a determinant identity. https://doi.org/10.46298/dmtcs.2699

Akses Cepat

Lihat di Sumber doi.org/10.46298/dmtcs.2699

Informasi Jurnal

Tahun Terbit: 2009
Sumber Database: DOAJ
DOI: 10.46298/dmtcs.2699
Akses: Open Access ✓