ConnectedInducedSubgraphCount on LabeledGraph
The nonempty sets of vertices that induce a connected subgraph.
FindStat's St001441. A set is connected when removing one of its vertices that is adjacent to the rest leaves a connected set; every connected graph has such a vertex. The graph with no vertices gives 0.
Called as CombinatorialStat(x, "ConnectedInducedSubgraphCount"). 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 St001441
The number of non-empty connected induced subgraphs of a graph.
| Object | Value |
|---|---|
([],1) | 1 |
([],2) | 2 |
([],3) | 3 |
([],4) | 4 |
([],5) | 5 |
([],6) | 6 |
([],7) | 7 |
([(0,1)],2) | 3 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St001441 has the rest.