=Paper=
{{Paper
|id=Vol-3106/Short_3.pdf
|storemode=property
|title=Magic Type Labeling of Graphs in Linear Ordering Problems
|pdfUrl=https://ceur-ws.org/Vol-3106/Short_3.pdf
|volume=Vol-3106
|authors=Marina Semeniuta,Zoya Sherman,Oleh Dmitriiev,Mykhailo Soroka
|dblpUrl=https://dblp.org/rec/conf/intsol/SemeniutaSDS21
}}
==Magic Type Labeling of Graphs in Linear Ordering Problems ==
https://ceur-ws.org/Vol-3106/Short_3.pdf
Magic Type Labeling of Graphs in Linear Ordering Problems
Marina Semeniuta, Zoya Sherman, Oleh Dmitriiev and Mykhailo Soroka
Flight Academy of the National Aviation University, Dobrovolsky str., 1, Kropivnitsky, 25005, Ukraine
Abstract
We obtained theoretical results for the development of methods for solving problems of
linear ordering of objects based on labeled graphs. Solving the problem of planning of fair,
equivalent and balanced (handicap) incomplete tournaments is equivalent to solving the
problem of constructing of corresponding distance magic or antimagic labeling of an
r -regular graph of order n . Let G (V , E ) be distance magic graph, different from
K1, 2, 2,...., 2 .We have proved the conjecture, which was presented by K. Sugeng, D.Froncek
and others (K.A. Sugeng, D. Froncek, M. Miller, J. Ryan and J. Walker, On distance magic
labeling of graphs, J. Combin. Math. Combin. Comput., 71 (2009), 39-48), that a set of
vertices of the graph G can be partitioned into sets V1 , V2 , ...,V p , in such way that Vi 1
and G (Vi ) is the empty graph for every i 1, 2,..., p . We have also presented some results
of edge and total vertex magic labeling of graphs/
Keywords 1
Graph, labeling, tournament, clique, independent set
1. Introduction
The problem of linear ordering of objects is the mathematical model for many real life problems.
There are different models of linear ordering, which include models of the ”sports” type. The main
feature of this “sports” group is that its models use sum of points scored by the object as a ranking
factor. Tournament models are widely used because of the simplicity of getting of the optimal
solution. The quest for the optimal solution in planning of incomplete round-robin tournaments can be
achieved with the help of methods of the graph labeling theory. In this paper, our main focus is on the
properties of graphs with magic labeling, which can serve as models of incomplete round-robin
tournaments. With a large number of competing teams, it is impossible to complete round-robin
tournament in short period of time. Therefore, it is really necessary to have incomplete tournaments
that imitate the complexity of a full round-robin tournament. There are several types of incomplete
tournaments; each of them possesses its own, certain characteristics. Solving the problem of planning
of fair, equivalent and balanced (handicap) incomplete tournaments for 𝑛 teams playing against 𝑟
opponents is equivalent to solving the problem of constructing of corresponding distance magic or
anti-magic labeling of an r -regular graph of order n . The questions, regarding the existence of
tournament graphs and methods of their construction, are very well described in works of D. Froncek,
P. Kovar, T. Kovarova, A. Shepanik, M. Semeniuta.
Magic-type labelings are widely used in automated information systems. They come in handy
when one needs to calculate a check sum or to avoid using a lookup table. Simple graph may
represent a network of nodes and links with addresses (labels) intended for both links and nodes. If
the addresses form an edge magic labeling, it is enough to know the addresses of two vertices in order
to determine the address of their link without the lookup table, by simply subtracting the addresses
from the magic constant. The method for solving this problem is associated with a variety of
alternative solutions and requires the selection of optimal one; it also includes the process of linear
II International Scientific Symposium «Intelligent Solutions» IntSol-2021, September 28–30, 2021, Kyiv-Uzhhorod, Ukraine
EMAIL: marina_semenyuta@ukr.net (A. 1); sherman.zoya@gmail.com (A. 2); Dmitronik70@i.ua (A. 3) Dmitronik70@i.ua (A. 4)
ORCID: 0000-0003-4639-0545 (A. 1); 0000-0002-9050-2068 (A. 2); 0000-0003-1079-9744 (A. 3); 0000-0003-1894-4002 (A. 4)
© 2020 Copyright for this paper by its authors.
Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).
CEUR Workshop Proceedings (CEUR-WS.org)
194
ordering of objects [1]. The aim of this study is to obtain the theoretical groundwork for the
development of methods, which will allow us to solve the problems of linear ordering of objects
based on labeled graphs.
2. Literature Survey. Preliminary theoretical information
A. Rossa is considered to be the founder of the theory of labeling. He offered several types of
labeling as a tool for decomposing a complete graph into isomorphic subgraphs. Magic labeling was
first presented by D. Sedlyacek as a generalization of the concept of a magic square. D. Sedlyachek
called the edge labeling of graph 𝐺 as magical in case of backward numbers existence, as the label of
the edges of 𝐺, with the following properties: (1) different vertices have different vertex labeles, and
(2) the sum of the values of the labels assigned to all edges incident to a given vertex is the same for
all vertices of graph 𝐺. Details of edge-magic graphs can be found in the book ”Magic and Antimagic
Graphs” [2]. The book [2] also summarizes the results on total vertex-magic labeling presented by
J. MacDougall, M. Miller, Slamin, and W.Wallis in 1999 [3]. The concept of distance magic labeling
was introduced independently by several authors [4, 5]. A detailed overview on this topic can be
found in [6] and [7]. At present, graph labeling theory is a popular tool for solving a wide range of
problems [7].
We consider only finite undirected graph without loops and multiple edges. We denote G (V , E )
as a graph, where V is the set of vertices, and E is the set of edges. For the degree deg G (u ) (or
deg(u ) ) of the vertex u of the graph G , the number of edges incident to u is equal. The maximum
and minimum degrees of the vertices of the graph 𝐺 are denoted by the symbols (G) and (G )
respectively.
If S is a finite set, then we denote S as its power. A set of subsets of a set S is called a partition
S if the union of these subsets coincides with S and no two of them intersect.
Some graphs have certain names and designations. A graph of order n is called complete when
each pair of its vertices is adjacent and it is denoted K n . Graph G (V , E ) is considered to be k -
partition if we can represent V as a disjunctive union of sets V1 , V2 , ...,Vk so that each edge of G
connects only vertices from different sets. If each vertex Vi is adjacent to each vertex V j for any
i, j 1, 2, ..., k , i j and Vi V j ∅, then G is a complete k -partition graph, which we denote as
K n1 , K n2 , ..., K nk , where Vi ni . If the graph is given by the set of vertices V {v1 , v2 , ..., vn } and the
set of edges E {(vk , vk 1 | k 1, ..., n 1} , then it is called a path of order n and is denoted Pn . A
cycle C n of order n ( n 3 ) is a closed path. A graph is considered empty if the degrees of all its
vertices are zero.
For any subset A V (G) of the set of vertices of a graph G (V , E ) , the generated subgraph
G(A) is the maximum subgraph of the graph G with the set of vertices A . Two vertices with A are
adjacent in G(A) if and only if they are adjacent in G . A subset B V (G) is called a clique if the
subgraph G(B) generated by it is complete. The graph G(B) is also called a clique. A subset of the
vertices of a graph is called independent if the subgraph generated by it is empty. The terminology on
graph theory used in this article is presented in more detail in [8].
Distance magic labeling of graph G (V , E ) of order p is a bijection f :V (G) {1, 2, ..., p} , for
which there exists an positive integer number k , such for every vertex u equality k f (v) is
vN ( u )
fair, where N (u ) is a set of vertices of graph G adjacent with u . Number k is called magic constant
of labeling f , and a graph, which allows such labeling is distance magic.
Let us denote the theorems which used in the article.
Тhеоrem 1. [4] Let G be a graph of order p which has two vertices of degree p 1 . Then G is
not a distance magic graph.
Perfect matching M (or 1-factor) in a graph G is a 1-regular spanning subgraph of G .
Тhеоrem 2. [6] Let G be a graph of order p with (G) p 1 . Then G is a distance magic
195
graph, if and only if, when p is odd and G ( K p 1 M ) K1 , where M is perfect matching in
K p 1 .
Тhеоrem 3. If G ( K p 1 M ) K1 is a graph of odd order p with (G) p 1 , where M is
perfect matching in K p 1 , then G K1, 2,..., 2 .
Proof. Suppose, that G ( K p 1 M ) K1 is a graph of odd order p , where M is perfect
matching in K p 1 . Let u be a vertex of degree (G) p 1 in graph G , e.i. 𝑢 is adjacent with all
vertices of G . Every vertex of G , different from u is not adjacent to only one vertex. Thus,
G K1, 2,..., 2 .
The Theorem has been proved.
Corollary 1. Graph K1, 2,..., 2 is the distance magic graph.
The proof of the corollary follows directly from the theorems 2 and 3.
Example 1. Suppose G ( K 6 M ) K1 (fig.1). Let us set vertex labeling of G , as it is shown in
figure 1. The labeling is distance magic with magic constant k 21 . Let us identify the vertices with
their labels. We divide the set of vertices V (G) into subsets {1, 6} , {2, 5} , {3, 4} , {7} . They are
independent, moreover, these subsets are particles of the graph K1, 2, 2, 2 such that G K1, 2, 2, 2
Figure 1: Distance magic labeling of the graph G ( K 6 M ) K1 .
The edge labeling of graph G (V , E ) is defined as the mapping of edge set E into a set of
positive integer number N . Number (e) , in which an edge e E is mapped, is called their label.
Index * (u ) of vertex u V at edge labeling 𝜑 is called a sum of labelinges of all edges which are
adjacent to 𝑢. Edge labeling of graph G is magic, if is an injection E (G ) into N and the
weight of the vertex does not depend on the choice of the vertex. Graph, which allows magic labeling,
is called magic. We define a constant value of index as magic constant and denote as . Magic
power ( ) of labeling is maximum of the label, used in , and a magic power (G ) of graph
G is minimum of the magic powers of the magic labelings, which the graph allows. If the graph G is
not magic, then (G ) 0 by definition.
We can classify the graphs. Class M ( ) , N includes those graphs that have a magic index 𝜇,
all non-magical graphs make up class M (0) .
Another type of magic graph labeling which is considered in the article is total vertex-magic
labeling. The domain of total labeling of graph G (V , E ) is set V E .
The total vertex-magic labeling of a graph G (V , E ) of order p and size q is denoted as a
bijection g :V E {1, 2, ..., p} , for which there exists such a constant k , that for each vertex
u V the equality holds g (u ) g (uv) k . The number k s called the magic constant, the sum
vV ( u )
g (u ) g (uv) w(u ) is called the weight of the vertex u , and the graph G allowing the labeling
vV ( u )
196
g is called total vertex-magic.
3. Problem Statement
When planning sports competitions, when there is no possibility of holding a full round
tournament, the organizers of the competition put forward the following requirements: each team
must play with the same number of opponents; the complexity of the tournament for each team should
imitate the complexity of a full round robin tournament. To implement the second condition, n teams
are ranked, for example, based on the results of the previous year [9]. Teams can be evaluated in the
range from 1 to n , according to the occupied seats. Let’s identify the team number with its rank. The
strength of the i -th team in a full round tournament as understood as number sn (i ) n 1 i , and
the total strength of the opponents of this team is the number S n , n 1 (i ) n(n 1) / 2 s n (i )
(n 1)( n 2) / 2 i. The sequence of all common strengths, arranged in ascending order, forms
an arithmetic progression with a difference of one. Therefore, to simulate a similar difficulty in an
incomplete round robin tournament, it is necessary to obtain an arithmetic progression from the total
strength of the opponents of each team. If such a tournament of n teams with r rounds, where
r n 1 arises from a round robin tournament by omitting certain matches, provided that each team
must play the same number of matches, it is denoted by FIT(𝑛, 𝑟) and is called a fair incomplete
tournament. In FIT(𝑛, 𝑟), each team plays with r other teams, and the total strength of opponents
playing with the i -th team is determinedby the formula S r , n (i) (n 1)(n 2) / 2 i k for each i
and a fixed constant k . On the other hand, missed matches also form a kind of tournament, denoted
by EIT(𝑛, 𝑛–𝑟–1) and called an equivalent incomplete tournament. In EIT(𝑛, 𝑛–𝑟–1) each team plays
n r 1 matches and the total strength of the opponents S r*, n (i ) of the i -th team is the same and
equal to the constant k , i.e. S r*, n (i) k . Obviously, FIT(𝑛, 𝑟) exists if and only if its complement
EIT(𝑛, 𝑛–𝑟–1) exists. These tournaments have been studied in [9, 10, 11, 12].
The mathematical model of the tournament can be a finite undirected graph that does not contain
loops and multiple edges. Each team corresponds to the vertex of the graph and the two vertices are
adjacent if a match has taken place between the respective teams. Since the rank of the command
coincides with its number, the numbers from 1 to n are used as labels of the vertices of a graph of
order n. Finding EIT(𝑛, 𝑟) is equivalent to solving the problem of the existence of remote magic
labeling for an r -regular graph G of order n . In this regard, the paper considers the problem of
finding the conditions for the existence of a distance magic labeling of a graph that is not isomorphic
to the graph. Let us consider a system of p elements. The connections between its elements are
assigned with numerical characteristics belonging to the set of natural numbers. Each element has a
weight function equal to the sum of the numerical characteristics of the connections corresponding to
this element. The system has the following properties: 1) different connections correspond to different
natural numbers, 2) the weight function does not depend on the choice of the system element, i.e. It is
a constant. It is necessary to choose from all variants of numerical characteristics of connections of
the system the one for which weight function (constant) accepts the minimum from possible values.
The mathematical model of this system is a magic graph with the least magical power of those
magical labelings that it allows. Therefore, the actual problem is to determine the properties of graphs,
which will make it possible to find the necessary and sufficient conditions for their magic.
4. One sufficient condition for existence of distance magic labeling of the
graph
The following theorem is presented in [13] as a conjecture. Let us prove it.
Тhеоrem 4. If G (V , E ) is a distance magic graph different from K1, 2,..., 2 , then the set V of
vertices can be partitioned into sets V1 , V2 , ...,V p in such way that Vi 1 and G (Vi ) is the empty
graph for every i 1, 2, ..., p .
Proof. According to the conditions G (V , E ) is a graph other than K1, 2,..., 2 , and G allows
distance magic labeling f . Let G be a connected graph, in other case every component of the
197
connectivity of this graph should be investigated in a similar way separately.
Any graph can be decomposed into subgraphs, each of which is a click or an empty graph.
Therefore, we examine the graph G with the partition of the set of vertices V (G) on clicks and
independent sets. Let V1 , V2 , ...,V p be the partitions, and V1 is a click of order n , and V2 , V3 , ...,V p are
independent sets. In addition, we will assume that n is a minimum number for which there is a
specified partition, otherwise the partition process can be continued.
Let denote the vertices G (Vi ) as {u1i , u2i , ..., u iVi } and the degree of vertex u ij in graph G as
degG (u ij ) , where i 1, 2, ..., p , j 1, 2, ..., Vi .
If S is a sum of vertex labels in G (V1 ) and deg G (ul1 ) deg G (u1m ) n 1 , where ul1 , u1m V1 , then
we obtain the following weights for these vertices: wG (ul1 ) s f (ul1 ) and wG (u1m ) s f (u1m ) .
Here we have f (ul1 ) f (u1m ) . Thus, the degrees in a graph G less than n 1 of vertices from set
{u1i , u2i , ..., u iVi } must exceed n 1 , otherwise the condition of being magic is violated. But in this case
you can get a new partition into V (G) subsets, each of which is empty. Similar considerations can be
performed if there is more than one click in the partition.
Suppose, that among V1 , V2 , ...,V p , there are at least two sets of power one, for example, |
V1 V2 1 . Then vertices u1i Vi ( i 1, 2 ) must be adjacent to every vertex of the corresponding set
V Vi in graph G . According to theorem 1, the graph G is not distance magic. We came to a
contradiction with the condition of the theorem 4.
If there is only one set Vi from Vi 1 , then its only vertex u1i Vi is adjacent to every vertex of
the set V Vi in graph G . According to theorems 2 and 3, and the corollary 1, we get G K1, 2,..., 2 ,
which contradicts the condition of the theorem 4. The theorem has been proved.
Corollary 2. Let G (V , E ) be a distance magic r -regular graph of order n . Then for the power
of any independent set Vi in G double inequality
n
1 Vi
r
is fair, where 𝜆 is the minimum eigenvalue of the adjacency matrix 𝐺.
The proof of the corollary 2 follows directly from theorem 4 and the known Delsart-Hoffmann
results with respect to the upper limit on the power of the independent set.
When we use distance magic graphs as mathematical models to solve specific practical problems,
then attention should be paid to the fact that the magic constant takes the only value for any distance
magic graph [14]. If G is a r -regular distance magic graph of order with a magic constant k , then
r (n 1)
for the labels of its vertices we obtain the equality: r (1 2 ... n) kn . Thus, k .
2
5. Magic types of labelings
Let G (V , E ) be a graph with p vertices and q edges, i.e. the ( p, g ) graph with edge
labeling . Let numbers x1 ,...x q form a set of edge labels of G . We denote the vertices of G as
u1 , u 2 ,...u p . It is obvious, G is the magic graph with magic constant if and only if, the system
* (u i ) (i 1,2,..., p ) .
of p linear equations with q 1 unknowns x1 ,...x q , , has a solution on the set of positive integer
numbers. If this system has no solution, it means that the graph is not magic. If there exists such a
solution, then it corresponds to the magical labeling of the graph G . In this case, there is an unlimited
family of magical labelings if this graph, and among them there is one that will give the value (G ) .
The matrix record the system of linear equation has the form
198
A(G ) X I ,
where A(G ) is the incidence matrix of graph G , X T ( x1 , x2 ,..., xq ), I – column-matrix with
p rows, all elements of which equal one.
Example 2. Determine the magical power of the graph G , shown in figure 2. We set the edge
labeling of the graph G , as it is shown in figure 2. Suppose, that G is magic with magic constant
. Then the system of linear equations for the graph looks like
* (u i ) , where i 1,2,..., p or
x1 x 2 ,
x 4 x5 ,
x 7 x8 ,
x x x x ,
1 3 8 9
2
x x 3 x 4 x 6 ,
x x x x .
5 6 7 9
After performing elementary transformations on the equations of the system, we obtain the
following equation x3 x6 x9 0 . Therefore, the system on the set of positive integer numbers
has no solution. We came to a contradiction with the assumption. Thus, the graph G has no magical
labeling, so its magical power is zero.
Figure 2: Graph G
The method of finding the magic labeling of a graph, and hence its magical power using a system
of linear equations is not effective, especially for graphs of large orders. Therefore, it is advisable to
obtain the properties of graphs that allow you to set the necessary and/or sufficient conditions of being
magic. For example, a magic graph cannot contain more than one edge with a ended vertex of degree
one, and it can not contain edges with ended vertices of degree two. It follows that a 1-regular graph
will be magical if and only if it is isomorphic of K 2 and there are no 2-regular magic graphs.
Representatives of class M (0) are all graphs containing a path of the form xyzt with
deg( y ) deg( z ) 2. Here are examples of such graphs.
Consider two connected graphs G1 and G2 , that have no common elements. Randomly select one
vertex in each column and connect them with a path Pk , each inner vertex of which does not belong
to any of the graphs G1 , G2 . The graph is denoted as G1 : Pk : G2 . Graph G1 : Pk : G2 .does not
allows magic labeling where k 4 , and graph Gm : Pp : Gn does not allow magic labeling where
3 m n for any k .
199
Let G1 , G2 ,..., Gk (k 2) be connected graphs, and ui V (Gi ) is a randomly selected vertex.
Then the graph, obtained conneсting edge of vertex u i of graph Gi with corresponding vertex u i 1
of graph Gi 1 for i 1,2,..., k 1 is called path connection of graph G1 , G2 ,..., Gk . Path connection
of an arbitrary number of cycles is not a magic graph.
The relations between the magic constant and the degrees of the vertices of the graph are presented
in the following lemmas.
Lemma 1. If graph G allows magic labeling with magic constant , then
(G ) and (G ) .
(G )
Proof. Weight of vertex of maximum degree of graph G is a sum of edge labels, each of
which is not less than one 1. Тhen (G ). The equal sign is possible only for the graph K 2 .
On the other hand, to the vertex of the last degree (G ) labels are incidental, which give the sum
of . Amoung them there is a label which not less that . Thus, (G ) .
(G ) (G )
Lemma has been proved.
Corollary 3. If G is a magic graph, then (G ) .
(G )
Lemma 2. Let G be a graph of order p , which allows magic labeling with magic constant .
Then the number p is even. Proof. Suppose, that the graph G of order p allows magic labeling
with magic constant . We denote the sum of all edges of graph G as S . Every vertex from p has
a weight 𝜇, then product p represents twice the amount of labels. Thus, p 2S .
Lemma has been proved.
Corollary 4. If graph G of odd order allows magic labeling with magic constant , then
0(mod 2) . In some cases, it is convenient to consider as mathematical models those graphs
which have total labeling that satisfy certain properties. Let us dwell on the study of regular graphs
with such labelings
For r regular graph G (V , E ) of order p and size q with total vertex-magic labeling g and
magic constant k there is dual labeling g ' , defined as follows g ' (u ) p q 1 g (u ) and
g ' (uv) p q 1 g (uv) for any u V , uv E. We denote magic constant for g ' as k ' , then
k ' k (r 1).
The graph G x (V x, E * ), where x E (G ) is obtained from the graph G (V , E )
adding a vertex 𝑥 and all edges, which are connecting the vertex to all vertices of set V (G ).
Let G be a regular graph of order p and size q with total vertex labeling g and. For the graph
G x we consider such a total labeling g * , that g * (u i ) g (u i ), g * (ui u j ) g (ui u j ),
g * (u i x) p g i, g * ( x) 2 p g 1, for any ui V (G), u i v j E (G ), where
i j, i, j 1,2,..., p . We obtain the following weights for the vertices of graph
G x : wt (ui ) k p g i, wt ( x) 3 p 2 5 p q( p 1) 1. . As we can see, the weights
1
2
of vertices ui in graph G x at different values i are different. If we suppose, that there is
i 1,2,..., p at which wt (ui ) wt ( x) , then we obtain k i p( p 1) pq 1. . This is
2
3
impossible since k i const. In this case, the labeling g is called total vertex-antimagic.
*
We have proved the following theorem.
200
Тhеоrem 5. If G is a regular total vertex-magic graph, then G x allows total vertex antimagic
labeling. It is easy to establish the relationship between the magical and total vertex-antimagic
labelings of 2-regular graphs.
Тhеоrem 6. Let G be a 2-regular magic graph of order p and size q with a set of edge labeles
{1, 2, , p} . Then G allows total vertex-antimagic labeling.
Proof. Let be a magic labeling of 2-regular graph G of order p and size q , whith a set of
edge labels {1, 2, , q} , and is his magic constant and V u1 , u 2 ,..., u p V {u1 , u2 , , u p } .
We denote total labeling g of graph G as the following: g (ui u j ) (ui u j ) , g * (u i ) q i for
* *
any u i V (G), u i v j E (G ), where i j, i, j 1,2,..., p . Let’s calculate the weights of the
vertices for labeling g * : wt (u i ) q i. They are all different, therefore, g * is total vertex-
antimagic labeling. The theorem has been proved.
6. Conclusion
In the course of the study, we obtained a proof of the hypothesis presented by K.Sugeng,
D. Froncek and others in [13], found the necessary conditions for the existence of a magic labeling of
graphs, established the relationship between the magic and total vertex-antimagic labeling of
2-regular graphs. The research results can be used in the development of real decision-making support
systems.
7. References
[1] P. Kovar 2004 Magic Labelings of Graphs. Ph.D. Thesis 79 p.
[2] M. Baca, M. Miller, J. Ryan, A. Semanicova-Fenovcikova 2019 Magic and Antimagic Graphs,
Springer, 340 p. https://doi.org/10.1007/978-3-030-24582-5.
[3] J. A. MacDougall, M. Miller, Slamin, and W. D. Wallis 2001 Vertex-magic total labelings of
graphs, Util. Math., vol. 61 pp. 3–21.
[4] V. Vilfred 1994 Σ-labelled graph and circulant graphs. Ph. D. Thesis, University of Kerala, Trivandrum, India.
[5] M. Miller, C. Rodger, R. Simanjuntak 2003 Distance magic labelings of graphs, Australian
Journal of combinatorics vol. 28 pp. 305-315.
[6] https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.401.4168rep=rep1type=pdf
[7] S. Arumugam, D. Froncek, N. Kamatchi 2011 Distance magic graphs – a survey, Journal of the
Indonesian Mathematical Society. Special Edition pp. 11-26.
http://dx.doi.org/10.22342/jims.0.0.15.11-26
[8] J. A. Gallian 2019 A dynamic survey of graph labeling.The Electronic Journal of
Combinatorics. DS6. 553 p.
https://www.combinatorics.org/ojs/index.php/eljc/article/view/DS6/pdf
[9] Ф. Харари 1973 Теория графов. – М.:Мир, 300 с.
[10] D. Froncek 2013 Handicap distance antimagic graphs and incomplete tournaments. AKCE
International Journal of Graphs and Combinatorics vol.10(2). pp. 119-127.
https://doi.org/10.1080/09728600.2013.12088729
[11] D. Froncek P. Kovar, T. Kovarova 2006 Fair incomplete tournaments. Bull. Inst. Combin.
Appl. vol. 48. pp. 31-33.
[12] D. Froncek 2007 Fair incomplete tournaments with odd number of teams and large number of
games. Congr. Numer vol. 187. pp. 83-89.
[13] М. Ф. Семенюта, З.А. Шерман, О.Н. Дмитриев 2018 Неполные турниры и магические
типы разметок. Управляющие системы и машины №5 (277) c.13-24.
[14] K. A. Sugeng, D. Froncek, M. Miller, J. Ryan and J. Walker 2009 On distance magic labeling
of graphs, J. Combin. Math. Combin. Comput. vol. 71 pp. 39-48.
[15] M. Semeniuta, V. Shulhin 2019 Matrices Associated with D-Distance Magic Graphs and Their
Properties, Cybernetics and Systems Analysis, vol. 55(3), pp. 112-
120. https://doi.org/10.1007/s10559-019-00151-6 .
201