CelebrityCount
The vertices of whom more than half the neighbors have a smaller degree.
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St001689via LabeledGraph✓CelebrityCount(graph)The vertices of whom more than half the neighbors have a smaller degree.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 St001689. 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(
(degrees: list<integer>) => Apply(
(adjacency: list<list<integer>>) => Max(Sum(Map(Function(1 if 2 *
Max(Sum(Map(Function(adjacency[v][w] *
(1 if degrees[w] < degrees[v] else 0), w), Range(1, n))), 0) >
degrees[v] else 0, v), Range(1, n))), 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),
),
),
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 |