networks[rankpoly] - (Whitney) rank polynomial of an undirected graph
|
Calling Sequence
|
|
rankpoly(G, x, y)
|
|
Parameters
|
|
G
|
-
|
undirected graph or network
|
x
|
-
|
rank variable in rank poly
|
y
|
-
|
corank variable in rank poly
|
|
|
|
|
Description
|
|
•
|
The rank polynomial is a sum over all subgraphs H of G of x^(rank(G) - rank(H)) y^corank(H).
|
•
|
The coefficient of in the rank polynomial is thus the number of spanning subgraphs of G having i more components than G and having a cycle space of dimension j.
|
•
|
This routine is normally loaded via the command with(networks) but may also be referenced using the full name networks[rankpoly](...).
|
|
|
Download Help Document
Was this information helpful?