Kirchhoff's theorem
id:
kirchhoff-s-theorem-179-15144719
title:
Kirchhoff's theorem
text:
In the mathematical field of graph theory, Kirchhoff's theorem or Kirchhoff's matrix tree theorem named after Gustav Kirchhoff is a theorem about the number of spanning trees in a graph, showing that this number can be computed in polynomial time from the determinant of a submatrix of the graph's Laplacian matrix; specifically, the number is equal to any cofactor of the Laplacian matrix. Kirchhoff's theorem is a generalization of Cayley's formula which provides the number of spanning trees in a
brand slug:
wiki
category slug:
encyclopedia
description:
On the number of spanning trees in a graph
original url:
https://en.wikipedia.org/wiki/Kirchhoff%27s_theorem
date created:
2004-12-12T23:29:32Z
date modified:
2024-09-05T02:16:09Z
main entity:
{"identifier":"Q2226691","url":"https://www.wikidata.org/entity/Q2226691"}
image:
fields total:
13
integrity:
15