InvariantGraphCount on IntegerPartition
The simple graphs on the points that a permutation of this cycle type maps to themselves: 2 to the number of edge orbits.
Called as CombinatorialStat(x, "InvariantGraphCount"). The head's page has its examples.
Live
Distribution
Over IntegerPartitions at each size, tallied here in your browser; sizes past 30 are not offered.
FindStat St000514
The number of invariant simple graphs when acting with a permutation of given cycle type.
| Object | Value |
|---|---|
[2] | 2 |
[3] | 2 |
[4] | 4 |
[5] | 4 |
[6] | 8 |
[7] | 8 |
[8] | 16 |
[1,1] | 2 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St000514 has the rest.