K-Sequentially additive labeling

[math]\displaystyle{ k }[/math]-Sequentially additive labeling --- [math]\displaystyle{ k }[/math]-последовательно аддитивная разметка.

Given a graph [math]\displaystyle{ G }[/math] with [math]\displaystyle{ p }[/math] vertices, [math]\displaystyle{ q }[/math] edges and a positive integer [math]\displaystyle{ k }[/math], a [math]\displaystyle{ k }[/math]-sequentially additive labeling of [math]\displaystyle{ G }[/math] is an assignment of distinct numbers [math]\displaystyle{ k, k+1, k+2, \ldots, k+p+q-1 }[/math] to the [math]\displaystyle{ p+q }[/math] elements of [math]\displaystyle{ G }[/math] sush that every edge [math]\displaystyle{ uv }[/math] of [math]\displaystyle{ G }[/math] receives the sum of the numbers assigned to the vertices [math]\displaystyle{ u }[/math] and [math]\displaystyle{ v }[/math]. A graph which admits such an assignment to its elements is called a [math]\displaystyle{ k }[/math]-sequentially additive graph.