matrix-tree theorem
Description: The matrix-tree theorem is a result in graph theory that computes the number of spanning trees of a graph from a determinant of its Laplacian matrix.
Primary topic: Graph theory and applications (27%)
Wikidata ID: wiki/Q2226691
OpenAlex ID: keywords/matrix-tree-theorem
