{"id":"https://openalex.org/keywords/matrix-tree-theorem","display_name":"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.","display_name_alternatives":["Kirchhoff's matrix-tree theorem","Kirchhoff's theorem"],"ids":{"openalex":"https://openalex.org/keywords/matrix-tree-theorem","wikidata":"https://www.wikidata.org/wiki/Q2226691"},"primary_topic":{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.2733,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.2733,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.2686,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"works_count":333,"cited_by_count":6695,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/matrix-tree-theorem","updated_date":"2026-11-18T04:07:20","created_date":"2022-04-12T19:38:12"}
