networks
tuttepoly
Tutte polynomial of an undirected graph
Calling Sequence
Parameters
Description
Examples
tuttepoly(G, t, z)
G
-
undirected graph or network
t
internal activity variable in Tutte poly
z
external activity variable in Tutte poly
Important: The networks package has been deprecated.Use the superseding command GraphTheory[TuttePolynomial] instead.
The Tutte polynomial is a sum over all maximal forests H of G of tia⁡H⁢zea⁡H where ia⁡H is the internal activity of H and ea⁡H is the external activity of H.
This routine is normally loaded via the command with(networks) but may also be referenced using the full name networks[tuttepoly](...).
with⁡networks:
G≔complete⁡4:
tuttepoly⁡G,t,z
t3+z3+3⁢t2+4⁢t⁢z+3⁢z2+2⁢t+2⁢z
tuttepoly⁡G,2,2
64
tuttepoly⁡G,2,1
38
tuttepoly⁡G,1,2
tuttepoly⁡G,1,1
16
See Also
GraphTheory
GraphTheory[TuttePolynomial]
networks(deprecated)[acycpoly]
networks(deprecated)[rankpoly]
with
Download Help Document