GraphTriangleCount
gives the number of triangles in the graph g.
Details
![](Files/GraphTriangleCount.en/details_1.png)
- 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.
![](Files/GraphTriangleCount.en/Image_1.gif)
Examples
open allclose allScope (4)
GraphTriangleCount works with undirected 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)
Wolfram Research (2024), GraphTriangleCount, Wolfram Language function, https://reference.wolfram.com/language/ref/GraphTriangleCount.html.
Text
Wolfram Research (2024), GraphTriangleCount, Wolfram Language function, https://reference.wolfram.com/language/ref/GraphTriangleCount.html.
CMS
Wolfram Language. 2024. "GraphTriangleCount." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/ref/GraphTriangleCount.html.
APA
Wolfram Language. (2024). GraphTriangleCount. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/GraphTriangleCount.html