Skolem-graceful graph
Материал из WEGA
Skolem-graceful graph --- грациозный по Сколему граф.
A graph [math]\displaystyle{ G }[/math] with [math]\displaystyle{ p }[/math] vertices and [math]\displaystyle{ q }[/math] edges is Skolem-graceful if it admits a Skolem-labeling defined as follows: the vertex labels are [math]\displaystyle{ 1, 2, \ldots, p }[/math] and the edge labels are [math]\displaystyle{ 1, 2, \ldots, q }[/math].
