networks(deprecated)/acycpoly - Maple Help

networks

 acycpoly
 acyclicity polynomial of an undirected graph

 Calling Sequence acycpoly(G, p)

Parameters

 G - undirected graph or network p - variable in acyclicity poly (usually edge probability)

Description

 • Important: The networks package has been deprecated.  Use the superseding command GraphTheory[AcyclicPolynomial] instead.
 • The acyclicity polynomial in variable p gives the probability that G is acyclic when each edge operates with probability p.
 • This routine is normally loaded via the command with(networks) but may also be referenced using the full name networks[acycpoly](...).

Examples

Important: The networks package has been deprecated.  Use the superseding command GraphTheory[AcyclicPolynomial] instead.

 > $\mathrm{with}\left(\mathrm{networks}\right):$
 > $G≔\mathrm{complete}\left(4\right):$
 > $\mathrm{addedge}\left(\left\{\left\{1\right\},\left\{1,2\right\}\right\},G\right):$
 > $\mathrm{acycpoly}\left(G,p\right)$
 ${-}{\left({-}{1}{+}{p}\right)}^{{5}}{}\left({10}{}{{p}}^{{3}}{+}{9}{}{{p}}^{{2}}{+}{4}{}{p}{+}{1}\right)$ (1)
 > $\mathrm{acycpoly}\left(G,\frac{1}{2}\right){2}^{\mathrm{nops}\left(\mathrm{edges}\left(G\right)\right)}$
 ${52}$ (2)