|
networks[counttrees] - counts spanning trees of an undirected graph
|
|
Calling Sequence
|
|
counttrees(G)
|
|
|
Description
|
|
|
•
|
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.
|
>
|
|
|
>
|
|
|
>
|
|
|
| (1) |
|
>
|
|
|
>
|
|
|
| (2) |
|
|
Download Help Document
Was this information helpful?
