OreDegree
The greatest sum of the degrees of the two ends of an edge.
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St000915via LabeledGraph✓OreDegree(graph)The greatest sum of the degrees of the two ends of an edge.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 St000915. A graph with no edge 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(
(degrees: list<integer>) => 0 if Length(edges) == 0 else Max(Map(Function(degrees[e[1]] + degrees[e[2]], e), edges)),
Map(
Function(Max(Sum(Map(Function((1 if e[1] == v else 0) +
(1 if e[2] == v else 0), e), edges)), 0), v),
Range(1, n),
),
), _x[2]), _x[1])Examples
Properties #
About
| Examples | 4 |
|---|---|
| Crosswalk | FindStat |