next | previous | forward | backward | up | top | index | toc | Macaulay2 web site
Graphs (missing documentation) :: numberOfTriangles

numberOfTriangles -- counts how many subtriangles are present in a graph

Synopsis

Description

A triangle is formed by three vertexSet which are mutually adjacent.
i1 : G = graph({{1,2},{2,3},{3,1},{3,4},{2,4}},EntryMode=>"edges");
i2 : numberOfTriangles G

o2 = 2

See also

Ways to use numberOfTriangles :