Semeniuta M.F.
Combinatorial configurations in determination of antimagic labelings of graphs

We have formalized the definition of graph labeling in terms of combinatorial configurations. We have investigated the connection between edge and vertex (a, d)–distance antimagic labelings with such well-known configurations as separating systems and magic rectangle sets. We have obtained a solution to the problem of construction of indicated labelings for some types of graphs and certain values of a and d. © 2021, Springer Science+Business Media, LLC, part of Springer Nature.

Keywords: (a, antimagic labeling, biregular graph, combinatorial configuration, d)-distance antimagic labeling, magic rectangle set, regular graph, separating system, Cybernetics, Antimagic, Graph labelings, Labelings, Separating systems, Computer science

Cite:
Semeniuta M.F. (2021). Combinatorial configurations in determination of antimagic labelings of graphs. Cybernetics and Systems Analysis, 57 (2), 30–40. doi: https://doi.org/10.1007/s10559-021-00344-y http://jnas.nbuv.gov.ua/article/UJRN-0001221019 [In Ukrainian].