InducedFourCycleCount on LabeledGraph
The sets of four vertices that induce a cycle: every one has exactly two neighbors among the four.
FindStat's St001305. The graph with no vertices gives 0.
Called as CombinatorialStat(x, "InducedFourCycleCount"). 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 St001305
The number of induced cycles on four vertices in a graph.
| Object | Value |
|---|---|
([],1) | 0 |
([],2) | 0 |
([],3) | 0 |
([],4) | 0 |
([],5) | 0 |
([],6) | 0 |
([],7) | 0 |
([(0,1)],2) | 0 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St001305 has the rest.