TriangleCount
The triples of vertices that are pairwise adjacent.
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St000095via LabeledGraph✓TriangleCount(graph)The triples of vertices that are pairwise adjacent.Typed signatures
| Type | Package | Applies |
|---|---|---|
(labeled_graph) -> number | combinatorics | always |
Details
- Defined over
LabeledGraphas an expression in_x, evaluated by compute-engine — the definition IS the implementation. - Takes a
LabeledGraphand nothing else — it reads values against their positions, or walks the orbits, so it needs the bijection. Applying it to a bare list is a type error, not a wrong answer. - FindStat's St000095. An edge uv and a vertex w above v adjacent to both. The graph with no vertices gives 0.
Definition
Epsil, as the implementation runs it.
on LabeledGraph, over _x
0 if _x[1] == 0 else Apply((n: integer) => Apply((edges: list<list<integer>>) => Apply(
(adjacency: list<list<integer>>) => Max(Sum(Map(Function(Max(Sum(Map(Function((1 if w > e[2] else 0) *
adjacency[e[1]][w] * adjacency[e[2]][w], w), Range(1, n))), 0), e), edges)), 0),
Map(Function(Map(
Function(Max(Sum(Map(Function((1 if e[1] == i else 0) *
(1 if e[2] == j else 0) +
(1 if e[1] == j else 0) *
(1 if e[2] == i else 0), e), edges)), 0), j),
Range(1, n),
), i), Range(1, n)),
), _x[2]), _x[1])Examples
Properties #
About
| Examples | 4 |
|---|---|
| Crosswalk | FindStat |