Construct · 1 fields · 1 citations

matrix-tree theorem: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
matrix-treetheorem1 CONSTRUCTMatrix-tree theoremKIRCHHOFF · GRAPH ALGORITHMS

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Graph algorithms

the result that the number of spanning trees of a graph equals any cofactor of its Laplacian matrix.

In graph algorithms, matrix-tree theorem refers to the result that the number of spanning trees of a graph equals any cofactor of its Laplacian matrix. This meaning comes from Kirchhoff (1847) in Annalen der Physik.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how matrix-tree theorem sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

series3 fields · 3 citationsjingle · one word, three constructsmatrix3 fields · 4 citationsjingle · one word, three constructsnumber3 fields · 6 citationsjingle · one word, three constructs

References

  1. Kirchhoff, G. (1847). Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird. Annalen der Physik, 148(12), 497-508. https://doi.org/10.1002/andp.18471481202

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct