TriangleVertexCount on LabeledGraph
The vertices on a triangle.
FindStat's St001995. A vertex lies on a triangle when it is adjacent to both ends of some edge. The graph with no vertices gives 0.
Called as CombinatorialStat(x, "TriangleVertexCount"). 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 St001995
The number of vertices of a graph contained in a triangle.
| 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/St001995 has the rest.