InducedPathOnFourVerticesCount on LabeledGraph
The sets of four vertices that induce a path: three edges, and every vertex has one or two neighbors among the four.
FindStat's St001306. The graph with no vertices gives 0.
Called as CombinatorialStat(x, "InducedPathOnFourVerticesCount"). 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 St001306
The number of induced paths 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/St001306 has the rest.