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
Usage:
t = numberOfTriangles G
Inputs:
G
,
an object of class
Graph
(missing documentation)
Outputs:
t
,
an
integer
, number of subtriangles in a graph
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
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
Ways to use
numberOfTriangles
:
numberOfTriangles(Graph)