InducedPathOnThreeVerticesCount on LabeledGraph
The sets of three vertices that induce a path: exactly two of the three edges.
FindStat's St001308. The graph with no vertices gives 0.
Called as CombinatorialStat(x, "InducedPathOnThreeVerticesCount"). 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 St001308
The number of induced paths on three 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/St001308 has the rest.