Transformation graph

Transformation graph --- граф преобразований.

A transformation graph (TRAG, for short) [math]\displaystyle{ {\mathcal G} }[/math] is given by a (not necessarily finite) set [math]\displaystyle{ V_{{\mathcal G}} }[/math] of vertices and a finite set [math]\displaystyle{ \Lambda_{{\mathcal G}} }[/math] of (not necessarily total) transforma\-tions of [math]\displaystyle{ V_{{\mathcal G}} }[/math]. The elements of [math]\displaystyle{ \Lambda_{{\mathcal G}} }[/math] specify labelled arcs in [math]\displaystyle{ {\mathcal G} }[/math], as follows. For each [math]\displaystyle{ v \in V_{{\mathcal G}} }[/math] and each [math]\displaystyle{ \lambda \in \Lambda_{{\mathcal G}} }[/math] which is defined at [math]\displaystyle{ v }[/math], there is an arc labelled by [math]\displaystyle{ \lambda }[/math] from the vertex [math]\displaystyle{ v }[/math] to the vertex [math]\displaystyle{ v\lambda }[/math] (the image of [math]\displaystyle{ v }[/math] under [math]\displaystyle{ \lambda }[/math]).

Another name is Data graph.