Supermagic graph

Supermagic graph --- супермагический граф.

If [math]\displaystyle{ G }[/math] is a [math]\displaystyle{ (p,q) }[/math]-graph in which the edges are labeled by [math]\displaystyle{ 1,2, \ldots, q }[/math] so that the vertex sums defined by [math]\displaystyle{ f^{+}(u) = \sum\{f(u,v): (u,v) \in E\} }[/math] are constant, then [math]\displaystyle{ G }[/math] is called supermagic.