Kirchhoff's theorem
Theorem of computing the number of spanning trees in a graph
In the mathematical field of graph theory, Kirchhoff's theorem or Kirchhoff's matrix tree theorem is a theorem about the number of spanning trees in a graph. It states that this number can be computed as any cofactor of the graph's Laplacian matrix.
Nº Q2226691 ★★
Uncommon · Knowledge
Kirchhoff's theorem
Theorem of computing the number of spanning trees in a graph
In the mathematical field of graph theory, Kirchhoff's theorem or Kirchhoff's matrix tree theorem is a theorem about the number of spanning trees in a graph. It states that this number can be computed as any cofactor of the graph's Laplacian matrix.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
In the mathematical field of graph theory, Kirchhoff's theorem or Kirchhoff's matrix tree theorem is a theorem about the number of spanning trees in a graph. It states that this number can be computed as any cofactor of the graph's Laplacian matrix. This shows in particular that the number of spanning trees can be computed from the graph data in polynomial time. Kirchhoff's theorem is a generalization of Cayley's formula which provides the number of spanning trees in a complete graph. The theorem is named after the German mathematician Gustav Kirchhoff, who published it in 1847. An English translation of Kirchhoff's paper was published in 1958.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
Tree (graph theory)
Undirected, connected and acyclic graph
Nº Q272735 ★★★
Cycle space
Construction in graph theory
Nº Q5198175 ★
Steiner tree problem
Class of problems in combinatorial mathematics
Nº Q1764144 ★
Brooks' theorem
Theorem that, with two classes of exceptions, vertex-coloring a graph needs a number of colors at most equal to its maximum degree
Nº Q512897 ★
Cantor's theorem
In set theory, the theorem that a set has a strictly smaller cardinality than its powerset
Nº Q474881 ★★
Sylow theorems
The theorem that, for a finite group of order a mutiple of 𝑝ⁿ, there exist Sylow 𝑝-subgroups of order 𝑝ⁿ (all of whom are conjugate), whose number equals the index of the normalizer of any such subgroup
Nº Q1057919 ★★