|
GraphTheory[SpanningPolynomial]
|
|
Calling Sequence
|
|
SpanningPolynomial(G, x)
|
|
|
Parameters
|
|
|
G
|
-
|
undirected unweighted graph
|
|
x
|
-
|
variable or value
|
|
|
|
|
|
Description
|
|
|
•
|
The SpanningPolynomial command returns a polynomial in x when x is a variable or the evaluation of the polynomial when x is a value. The value of this polynomial at a value 0 <= p <= 1 gives the probability that G is spanning (connected if G is connected) when each edge operates with probability p.
|
|
|
|
Examples
|
|
|
>
|
|
|
>
|
|
|
>
|
|
|
>
|
|
|
| (1) |
|
>
|
|
|
| (2) |
|
>
|
|
|
| (3) |
|
|
Download Help Document
Was this information helpful?
