counts spanning trees of an undirected graph
graph or network
Important: The networks package has been deprecated. Use the superseding package GraphTheory instead.
This procedure uses the Kirchhoff Matrix-Tree theorem to count spanning trees of G.
This routine is normally loaded via the command with(networks) but may also be referenced using the full name networks[counttrees](...).
G ≔ petersen⁡:
K34 ≔ complete⁡3,4:
Download Help Document
What kind of issue would you like to report? (Optional)