Enable JavaScript to interact with content and submit forms on Wolfram websites. Learn how

GraphTriangleCount

GraphTriangleCount[g]

gives the number of triangles in the graph g.

Details

GraphTriangleCount is also known as triangle count and three-vertex clique count.

GraphTriangleCount is typically used to measure clustering and connectivity in a graph.
GraphTriangleCount[g] counts cycles of length 3 in the graph g.

Examples

open allclose all

Basic Examples (2)

Count triangles in a graph:

Count triangles in social networks:

Scope (4)

GraphTriangleCount works with undirected graphs:

Directed graphs:

Use rules to specify the graph:

GraphTriangleCount works with large graphs:

Applications (1)

Compute the transitivity of a graph:

Compare with GlobalClusteringCoefficient:

Properties & Relations (2)

Use MatrixPower to count triangles in a graph:

Use FindCycle to list triangles in a graph:

Possible Issues (1)

Multi-edges are ignored:

Top