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

Synopsis

• Usage:

  t = numberOfTriangles G

• Inputs:
  • G, an instance of the type Graph,
• Outputs:
  • t, an integer, number of subtriangles in a graph

Description

i1 : G = graph({{1,2},{2,3},{3,1},{3,4},{2,4}},EntryMode=>"edges");

i2 : numberOfTriangles G

o2 = 2

See also

• hasOddHole -- checks whether a graph has a odd hole
• isCyclic -- determines whether a graph is cyclic
• inducedSubgraph -- A method for finding the induced subgraph of any Graph or Digraph