Content deleted Content added
m →References: Task 3a: Fix CS1 deprecated coauthor parameter errors |
m →Formal definition: removes explicit enumeration bounds, the step size is implicit |
||
Line 7:
Let ''G'' = (''U'' ∪ ''V'', ''E'') be a bipartite graph, i.e, the vertex set is ''U'' ∪ ''V'' where ''U'' ∩ ''V'' = ∅.
Let ''N''<sub>''G''</sub>(''v'') denote the neighborhood of a vertex ''v'' ∈ ''V''.
The graph ''G'' is '''convex''' over ''U'' if and only if there exists a [[bijective]] mapping, ''f'': ''U'' → {
for any two vertices ''x'',''y'' ∈ ''N''<sub>''G''</sub>(''v'') ⊆ ''U'' there does not exist a ''z'' ∉ ''N''<sub>''G''</sub>(''v'') such that ''f''(''x'') < ''f''(''z'') < ''f''(''y'').
| |||