networks(deprecated)/counttrees - Help

networks

 counttrees
 counts spanning trees of an undirected graph

 Calling Sequence counttrees(G)

Parameters

 G - graph or network

Description

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

Examples

Important: The networks package has been deprecated.  Use the superseding package GraphTheory instead.

 > $\mathrm{with}\left(\mathrm{networks}\right):$
 > $G≔\mathrm{petersen}\left(\right):$
 > $\mathrm{counttrees}\left(G\right)$
 ${2000}$ (1)
 > $\mathrm{K34}≔\mathrm{complete}\left(3,4\right):$
 > $\mathrm{counttrees}\left(\mathrm{K34}\right)$
 ${432}$ (2)