GraphTheory
SpanningPolynomial
compute spanning polynomial
Calling Sequence
Parameters
Description
Examples
SpanningPolynomial(G, x)
G
-
undirected unweighted graph
x
variable or value
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.
with⁡GraphTheory:
with⁡SpecialGraphs:
G≔PetersenGraph⁡:
f≔SpanningPolynomial⁡G,x
f≔704⁢x15−4920⁢x14+14430⁢x13−22755⁢x12+20370⁢x11−9828⁢x10+2000⁢x9
eval⁡f,x=0.75
0.8153727651
SpanningPolynomial⁡G,0.35
0.02142980972
See Also
EdgeConnectivity
IsConnected
TuttePolynomial
Download Help Document