SpanningSubgraphCount on LabeledGraph
The subgraphs on all the vertices: 2 to the power of the number of edges.
FindStat's St000343, the Tutte polynomial at x = y = 2. The graph with no vertices has one, so 1.
Called as CombinatorialStat(x, "SpanningSubgraphCount"). The head's page has its examples.
Live
Distribution
Over LabeledGraphs at each size, tallied here in your browser; sizes past 6 are not offered.
FindStat St000343
The number of spanning subgraphs of a graph.
| Object | Value |
|---|---|
([],1) | 1 |
([],2) | 1 |
([],3) | 1 |
([],4) | 1 |
([],5) | 1 |
([],6) | 1 |
([(0,1)],2) | 2 |
([(1,2)],3) | 2 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St000343 has the rest.