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](...).

$\mathrm{with}\left(\mathrm{networks}\right)\:$

$G≔\mathrm{petersen}\left(\right)\:$

$\mathrm{counttrees}\left(G\right)$

$2000$

$\mathrm{K34}≔\mathrm{complete}\left(3\,4\right)\:$

$\mathrm{counttrees}\left(\mathrm{K34}\right)$

$432$