(a,d)-Face antimagic graph
-Face antimagic graph --- -граневый антимагический граф.
A connected plane graph is said to be -face antimagic if there exist positive integers and a bijection
such that the induced mapping is also a bijection, where is the set of weights of a face. If is -face antimagic and is the corresponding bijective mapping of , then is said to be an -face antimagic labeling of .
The weight of a face under an edge labeling
is the sum of the labels of edges surrounding that face.