TriangleCount on LabeledGraph

The triples of vertices that are pairwise adjacent.

On LabeledGraph

FindStat's St000095. An edge uv and a vertex w above v adjacent to both. The graph with no vertices gives 0.

Called as CombinatorialStat(x, "TriangleCount"). 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.

Sizes 1 to

FindStat St000095

The number of triangles of a graph.

The number of triangles of a graph. A triangle $T$ of a graph $G$ is a collection of three vertices $\{u,v,w\} \in G$ such that they form $K_3$, the complete graph on three vertices.

Object	Value
([],1)	0
([],2)	0
([],3)	0
([],4)	0
([],5)	0
([],6)	0
([(0,1)],2)	0
([(1,2)],3)	0

Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St000095 has the rest.