number of spanning trees of graph
NumberOfSpanningTrees(G) returns the number of labeled spanning trees of the graph G.
The strategy is to evaluate the determinant of a certain matrix related to the graph. (See Introduction to Graph Theory, by Douglas B. West)
K3≔Graph 1: an undirected unweighted graph with 3 vertices and 3 edge(s)
K4≔Graph 2: an undirected unweighted graph with 4 vertices and 6 edge(s)
Download Help Document
What kind of issue would you like to report? (Optional)