Matrix Tree Theorem

Описание к видео Matrix Tree Theorem

The Matrix Tree Theorem provides a straightforward method for finding the number of labelled spanning trees of a given graph. The theorem tells us that we need only compute a cofactor of the graph Laplacian (degree matrix - adjacency matrix). The Matrix Tree Theorem generalizes Cayley's Formula, which gives the number of labelled trees of n vertices (this would correspond to the number of labelled spanning trees of the complete graph).

Комментарии

Информация по комментариям в разработке