Reasonable numbering

Reasonable numbering --- разумная нумерация.

A numbering of a cf-graph [math]\displaystyle{ G }[/math] is called reasonable if the following two properties hold:

(1) for any two distinct nodes [math]\displaystyle{ p }[/math] and [math]\displaystyle{ q }[/math], if [math]\displaystyle{ p }[/math] is a dominator of [math]\displaystyle{ q }[/math], then [math]\displaystyle{ F(p)\lt F(q) }[/math].

(2) if [math]\displaystyle{ G }[/math] is an arrangeable graph, then [math]\displaystyle{ F }[/math] is its arrangement.