NonTriangleVertexCount on LabeledGraph
The vertices on no triangle.
FindStat's St001996. The graph with no vertices gives 0.
Called as CombinatorialStat(x, "NonTriangleVertexCount"). 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 St001996
The number of vertices of a graph not contained in a triangle.
| Object | Value |
|---|---|
([],1) | 1 |
([],2) | 2 |
([],3) | 3 |
([],4) | 4 |
([],5) | 5 |
([],6) | 6 |
([],7) | 7 |
([(0,1)],2) | 2 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St001996 has the rest.