Aph PDF

Antimagic Labelling And its
Characteristics in Higher Order

Graphs and Their Union
Sajid Mahboob Alam

MPhil-Math-19
2016-18
Department of Mathematics
Faculty of Basic Sciences and Mathematics
MINHAJ UNIVERSITY LAHORE

Antimagic Labelling and its
characteristics in higher order graphs
and their union
By
Sajid Mahboob Alam
A THESIS SUBMITTED IN PARTIAL FULFILLMENT OF THE

REQUIREMENTS FOR THE DEGREE OF MASTER OF
PHILOSOPHY IN MATHEMATICS
Supervised by
Dr. Imran Siddique
Department of Mathematics

HAMDARD CHOWK TOWNSHIP LAHORE
AUGUST 2018
Pakistan
i
Declaration
I, Mr. Sajid Mahboob Alam Registration No. 19 student at Depart-

ment of Mathematics, Minhaj University, Lahore. This thesis titled
”Antimagic Labelling and its characteristics in higher order

graphs and their union.”
is my own work and the work.
Dated Signatureof Deponent
ii
DEPARTMENT OF MATHEMATICS
The undersigned hereby certified that they have read and recommend to the
Faculty of Science for acceptance a thesis entitled ”Antimagic Labelling and
its characteristics in higher order graphs and their union” by Sajid Mahboob
Alam in partial fulfilment of the requirements for the degree of Master of
Philosophy.
Dated: Aug. 2018
Supervisor: Dr. Imran Siddique
External: External Examiner
Chairman: Chairman
iii
I humbly dedicated my efforts
to my brother Dr. Abid
Mahboob and my parents.
iv
Contents
1 Graph Theory History 1
2 Definitions 5
3 Multigraph 7
4 A Directed graph 8
5 Elementary Graph Properties 9
6 Isolated Vertex 10
7 Degree Sequence 10
8 Types of Graphs from Degree Sequences 11
9 Digraphs 11
10 sub-graph 12
11 Clique Number 13
12 Graph Complement 14
13 Hamiltonian / Eulerian Graph 14
14 Path / Cycle Graph 15
15 More Graph Properties: Diameter, Radius, Circumference

and Girth 15
16 More on Trails and Cycles 17
17 Acyclic Graph 17
18 Special Matrices and Vectors 18
v
19 Invertible Matrix 19
20 Super Edge-Antimagic labeling 20
21 Cycle with chord 25
22 Proposition 26
23 Super EAT labeling 32
24 Super antimagic labeling of Harary graphs 37
25 On Super (a, d)-EAT Labeling 38
26 On (a, d)-VAT labeling 39
27 ANTIMAGIC TOTAL LABELINGS FOR UNION OF GRAPHS 44

27.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . 44
27.1.1 Problem . . . . . . . . . . . . . . . . . . . . . . . . . 44
27.1.2 Theorem . . . . . . . . . . . . . . . . . . . . . . . . . 45
27.1.3 Problem . . . . . . . . . . . . . . . . . . . . . . . . . 47
27.1.4 Theorem . . . . . . . . . . . . . . . . . . . . . . . . . 47
28 Bibliography 56
Bibliography 56
vi
Acknowledgement
In the name of ALLAH, who is the source of all types of knowledge and
The last Prophet of ALLAH Muhammad (SAWW), who show us the
right path and right way to gain knowledge.
My brother Dr. Abid Mahboob supervised me in the respective sub-

ject as well as teach me high level research. He guide me in a leading subject
of mathematics and teach me the latest research. Also for spending his most
precious time in reading and correcting this thesis.
I am much grateful to all my teachers, they have always pray for me and
guide me in a very nice way.
I would like to thank my fellows and friends who support me in my stud-

ies. The total credit goes to my elder brother Dr. Abid Mahboob who
bear my expenses of studies since my matriculations.
Okara, Pakistan 2018 Sajid Mahboob Alam
vii
Abstract:
A labeling of a graph is a map that carries graph elements to the numbers
(usually positive or non-negative integers). The most common choices of
domain are the set of all vertices (vertex labelings), the edge set alone (edge
labelings), or the set of all vertices and edges (total labelings). This project
deals with two types of graph labeling namely, super (a, d) antimagic total
labeling and (a, d)-vertex antimagic total labeling. We provide super (a,
d) antimagic total labeling for disjoint unions of Harary graphs and disjoint
unions of cycles. We also provide (a, d)-vertex antimagic total labeling for
disjoint unions of Harary graphs, disjoint unions of cycles, sun graphs and
disjoint unions of sun graphs.
viii
Chapter 1
Basic terminology
In this chapter we discuss basics of graph theory. These are necessary
for the basis of the present study. Also see [36].
1 Graph Theory History

The theory of Graph started when Leonard Euler studied the Bridges of
Konigsburg problem. He solved it in Graph Theory and then it become one
of the important theory. Generally speaking, theory of Graph is applied
mathematics and is a branch of Combinatorics and Computer Science.
A graph consist of vertices and edges. A graph is labelled or unlabelled.

Now we discuss only labelled graph.
The theory of Graph developed much faster since 1960. About more
than eight hundread papers on labeling of graphs become the most papular
subject also about to complete survey by J. Gallian [24]. After the papular-
ity of this theory it convinced many authors to work in the field of labeling
of graphs and its results appear every year in the form of research papers.
This is because of its vast applications in communication design, network
design, circut design, astronomy, radar and coding theory. Actually Golomb
and Bloom and found the applications for labelings to different branches of
science and so it can be found that part of this work is in [18] and [19].
There are so much results in this theory that connected to the research
of Rosa in 1967 [32] and also research of Golomb in 1972 [25].
Many authors studied the types and properties of magic labelings, also
many others checked the applications of labeling. Simanjuntak, Baskoro and
Adithia [16], [17] using edge magic labeling showed a secret sharing scheme
1
construction. Based on Golomb’s and Bloom research [18], [19], Wallis [36]
explained a new concept edge magic total labeling for the radar pulse codes
and communication networks.
The antimagic graph notion introduced by Ringel and Hartsfield in [27].
In 1987, Cahit [20] found a variation of both harmonious and graceful

labelings. A φ is a mapping to {0, 1} from set of vertices of G and every
edge vu assign label |φ(v)φ(u)|. The labeling φ is said to be cordial labeling
of G if it is zero and one difference is at most 1.
Graph labeling is consist of mapping which must be injective mapping con-
taining the elements of G=(V,E) (it may be edges, vertices, combinations or
faces) to a set of no. (+ve integers). This thesis consist of only a mapping
from set of edges, vertices, combinations or faces. The supertotal labeling
notion is known as labeling containing domain of edges, vertices, combina-
tions or faces. As we know that there are 3 possible cases while explaining a
graph labeling. vertex-evaluation, face evaluation and edge-evaluation. The
evaluation is (a; d)-antimagic when it is made by arithmetic progression
from point a and d difference, d ≥ 0. If d is equal to zero then this type of
labeling known as th magic labeling. This is clear that antimagic labeling
has a particular type which is known as magic labeling.
It is stated that, developing of the theory of antimagic labeling have some
reasons which we discuss here. We discuss only two reasons of this labeling.
Firstly, we have many new types of problems to solve, we use this theory to
solve new problems as this is very interesting and easy to solve. We faces
many new problems in the field of group theory for example we faces the
problem of isomorphic subgroup to solve, so we use this theory to solve it
easily for this we apply graceful labeling. Secondly, this theory is came for-
ward for the human curiosity. Magic labeling is the example of this type.
Now the question arise why to use this theory, for this we consider these
1. The objects which holds this property.
2
2. Prove property?
3. Have we applications of this type of property?
First question lead us to develop an idea of new theory which is graph

labeling, for this we study the structure and the properties of labeling. Sec-
ondly, answer of the question number 2 is that how to prove it using graphs
that have graph labeling and find the suitable schemes of graphs. In the
end we need to find the answer of the last question, is any application of the
graph labeling and it has uses in the different fields. We put forward the
idea of magic and antimagic labelings and try to prove it with properties
and labeling schemes.
Mostly this research based on the development Rosa’s research. Rosa

defined a mapping h: G −→ Z, where v vertices and Z = {1, 2, 3, ..., n},
n be edges. This labeling is said to be labeling valuation by Rosa. Indi-
vidually, graceful labeling is introduced by Golomb which is the same type
of labeling evaluation. There is much theoretical development in the graph
labeling but at the same time researchers are in the search of its applications.
We use standard notations and symbols for this thesis.
3
Outline of thesis
First Chapter consist of preliminaries notations and history of the theory of

graphs.
Second Chapter contains some definitions and basics of irregular and cordial
labeling, magic, antimagic, harmonies, graceful and certain known results.
Chapter 3 have informations of known results of total edge product cordial

labeling and cordial labeling of present new results of the total edge product
cordial labeling of convex polytope graphs.
Chapter 4 consist of the super antimagic labeling, some lammas, theorems and
their proves. References are given in the end.
4
Chapter 2
2 Definitions
Consider a G is a graph, vertex s ∈ V called adjacent to t ∈ V if ∃ edge st
between s and t. Vertex t is known as neighbour of s. The no. of v’s which
adjacent to s is said to be degree of s and its notation is deg(s). So deg(s)
= |N(u)|. If ∃ not a single such vertex i.e deg(s) = 0 is known as isolated
vertex and similarly vertex containing single vertex i.e deg(s) = 1 will be
end vertex (or simply leaf). The smallest deg(G) is shown as δ = δ(G) =
minis∈V deg(s) and largest deg(G) is represented as ∆ = ∆(G) = maxs∈V
deg(s). A graph is known as regular if each v in G consist of similar degree
u, i.e, δ = ∆ = u, simply it is also represented as an r-regular graph.
Suppose that G1 and G2 are 2 graphs with same order, these are isomorphic
if ∃ 1-to-1 mapping h: G1 −→ G1 that have adjacency property. S h(s) is
adjacent to h(t) iff s is adjacent to t. If G2 = G1 then h is automorphism.
Definition 2.1. Suppose that G = (V, E) is a graph with vertices V and

edges E.
Figure 1: Graph of G
Example 2.2. Since V = {4, 3, 2, 1}. Then E = {{4, 1}, {3, 2}, {2, 1}, {1, 4}}
Then G = (V, E) has 4 vertices and 4 edges. We can show a graph with many
5
Figure 2: Simple and non simple graph
different ways. However, commonly a graph can be represented by a figure.

A meeting point of lines (edges) is said to be vertex. It can be a circle as
well as dot.
2
1
4 3
Figure 3: The visual representation of G
Figure 9. The visual representation of G A graph is denoted by a figure
6
in which lines are edges and meeting point of 2 lines are vertices.
Definition 2.3. Suppose that G is a graph, s ∈ V and deg(s) be the degree
of s, number of nonself loop e adjacent to s + 2x number of selfloops at s.
K be the set, so |K| be any number.
Remark 2.4. All vertices have degree 2 in Figure 9.
Example 2.5.
E = {{a, b}, {c, d}, {b, c}, {d, a}
then visual representation has a loop that starts at a and ends at the same
point.
Definition 2.6. A connected graph is a graph in which each pair of u con-
tained in G joined with a path. We will show it as c-graph. A maximal
c-subgraph H ≤ G, where H is a subgraph of G is known as component of G.
A disconnected graph has more then 1 components. Any edge of a c-graph
G is known as cut-edge for G - e be disconnected. Similarly vertex u of a
c-graph G is cut-vertex for G - u be disconnected.
Definition 2.7. A tree is a c-acyclic graph. One cycle graph is known as
unicyclic graph. A forest is a graph which have every component as tree.
3 Multigraph
Definition 3.1. G is a multi-graph if ∃ 2 e1 , e2 in E so that e1 = e2 . So
that, ∃ 2 vertices e1 , e2 ≤ V such that e2 = e1 = {υ2 , υ1 , }.
Example 3.2. Suppose that the graph connected with Bridges of Konigsburg.
The set V = {E, F, H, I} be a vertex set. Then:
E = {{E, H}, {E, F }, {E, I}, {E, I}, {E, I}, {F, I}, {H, I}}
be the edge collection This is multi-graph as there are 2 bridges attach island
E with F and 2 bridges attached island E with H. If 2 vertices are attached
by 2 or above edges, so edges are describes parallel lines.
7
Island(s)
A D
Bridge
B
Figure 4: Multigraph
Figure 4. A multigraph has a pair of nodes, there can be one or more

edges connected with them.
4 A Directed graph
Definition 4.1. A graph is said to be directed or (digraph) if it is consist
of a tuple with v vertices V × V and e edges of G = (V, E).
Example 4.2. Suppose that we have a graph which is the digraph with vertex
and edge set. This graph is explained in Fig. 5(a). Also modified selfloop
set of edges becomes:
E = {(1, 2), (3, 4), (2, 3), (1, 1), (4, 1}
Example 4.3. Consider the vertices that show islands in the Konigsburg
Bridges Problem with edges are bridges. We can check that a tour is only
one that we cross the bridge. It is clear that the tour begin from initial point
and carry on its journey to reach at the final point that is 4 and starting
point is one.
8
1 2
1 2
4 3
4 3
Figure 5: (a) Directed graph (b) Directed graph with loop
Definition 4.4. Suppose that there is a graph G = (V, E) it is said to be

multi-digraph, if G is the graph having loop that starts and end at same e
when each edge (v2 ), v1 is interchanged by {v2 , v1 } so make the edge nondi-
rectional.
Figure 6: Digraph
5 Elementary Graph Properties

Definition 5.1. G is empty or null graph if V = θ. G is trivial if V = {υ}
and E = θ.
9
Figure 7: Empty Graph
6 Isolated Vertex
Definition 6.1. v vertex is said to be isolated if v is a member of set V and
If degree of the vertex v is zero.
7 Degree Sequence
Definition 7.1. Suppose that G with degree sequence is a sequence d ∈ Z n
arranged by the deg(v) ∈ V with decreasing order.
Example 7.2. Graph in Fig. 8.

(1) v5 = 1
(2) v4 = 2
(3) v3 = 2
(4) v2 = 3
(5) v1 = 4 and can be written as d = (4, 3, 2, 2, 1).
Theorem 7.3. Suppose G is a nonempty as well as nontrivial. Then G has

minimum 1 equal degree pair of vertices.
Proof. In this proof we use the basic rule of graph theory Pigeonhole Rule
and is described in Fig. 8, where degree of (v3 ) is equal to the degree of (v4 ).
Consider order of V is n. Each Vi have degree between 0 and n − 1 but
if G has vertex with 0 degree then there is no possibility of any vertex for
10
1
2
Figure 8: Degree Sequence
n − 1. So, total possibilities are n − 1 depends on the definition of isolated

vertex that it contain or not or a vertex of degree n − 1. Using Pigeonhole
Rule, There are minimum 2 such vertices that must have the similar degree
vertices.
8 Types of Graphs from Degree Sequences

Lemma 8.1. Suppose Km = (V, E) is complete, where m denotes the ver-
tices of that graph. Then |E| = m(m−1)
2
.
9 Digraphs
Theorem 9.1. Consider a digraph G = (V, E). Then following conditions
P
satisfied |E| = deg(v)
v∈V
11
Figure 9: Complete Graph
10 sub-graph
Example 10.1. The explanation of this type of graph is shown in Figure 10.
Now we show another type of the sub-graph that is Peter-sen. The sub-graph
have 10, 9, 8, 7, and, 6 vertices and edges are bridges between them.
1 1 6
6 6
2 2 10 7
5 5
8 9 8 9
10 7 10 7
4 3 4 3 9 8
Figure 10: (a) Petersen Graph (b) Highlighted Subgroup (c) Extracted sub-
group
Example 10.2. From the definition of the Petersen Graph we explain a new
12
sub-graph by vertex subset and a spanning subgraph. Fig. 11
(a) we explained sub-graph induced by V 8 = {10, 9, 8, 7, 6}. Also we note that
(b) Spanning sub-graph induced:
E 8 = {{9, 10}, {8, 9}, {7, 8}, {4, 10}, {6, 7}, {5, 8}, {6, 10}, {3, 7}, {2, 9}, {1, 6}}
1 1
6 6
5 2 5 2
8 9 8 9
10 7 10 7
4 3 4 3
Figure 11: (a)Highlighted Subgroup,(b)Spanning Subgroup
Figure 11. (a)Highlighted Subgroup,(b)Spanning Subgroup The sub-graph

(a) is induced by V 8 = {10, 9, 8, 7, 6}.
E 8 = {{9, 10}, {8, 9}, {7, 8}, {4, 10}, {6, 7}, {5, 8}, {6, 10}, {3, 7}, {2, 9}, {1, 6}}
11 Clique Number
Definition 11.1. Consider a graph G. The clique G, written ω(G) be ver-
tices with greatest clique in G.
Figure 12: (a) Cliques, (b) Independent set
Figure12.
13
Definition 11.2. Consider graph G. The independence number of G, shown
as α(G), is greatest independent set of G.
12 Graph Complement
Definition 12.1. The complement of a graph G is a graph such that:
e = {v2 , v1 } ∈ E 8 ⇔ {v2 , v1 }....E
Example 12.2. In Fig. 13. This is clear that complement of the G is

described.
Figure 13: Graph
Definition 12.3. If a walk has 3 minimum length, without repeated edges

and there are only 1st and last v are repeated is said to be a cycle. A Hamil-
tonian cycle has every vertex.
13 Hamiltonian / Eulerian Graph

Definition 13.1. Suppose a graph G = (V, E). It is called Hamiltonian
when it is consist of cycle Hamiltonian as well tour Eulerian.
14
Example 13.2. We explained a cycle,walk, Hamiltonian path and Eulerian
tour in Fig. 14 Formally, this is written as:
w = (1, {2, 3}, 3, {4, 2}, 2, {1, 4}, 4, )
Fig. 3.1(b) consist of cycle can be written as:

1 2 1
1
2 1 2
2
2
2
5
6 3
1
4 4 1
4 4
4 3 4
5 5
5
5
3 3
3
3
Figure 14: Hamiltonian Path
c = (1, {1, 4}, 4, {4, 2}, 2, {2, 3}, 3, {3, 1}, 1)
14 Path / Cycle Graph

Definition 14.1. Consider a graph G = (V, E) with |V | = m. If w is a
Hamiltonian path and H be sub-graph w induced also H = G, then G is m
path with m vertices written as Pm . Let w be Hamiltonian cycle with H is
sub-graph w induced and H = G, then G is m-cycle with m vertices written
as Cm .
Fig. 15 we show the 6 − cycle and 4 − path.
15 More Graph Properties: Diameter, Ra-

dius, Circumference and Girth
Definition 15.1. Suppose that there is a graphG = (V, E) is a directed
graph. Then distance between v1 to v2 contained in V is minimum length
directed walk from v1 to v2 if it exists. If not, then it is +∞.
15
6 1
5 2
1 2 3 4
4 3
Figure 15: 6-cycle, 4-path.
Definition 15.2. Suppose that there is a graph G = (V, E). The diameter
of Gdiam(G) be length of greatest distance in this graph. So that: dia(G) =
maxdG(v1 ; v2 )
Definition 15.3. Consider a graph G. If G has a cycle (cycle-graph as sub-

graph), so circumference of G is the length of largest cycle. If there is not
any such cycle, then the circumference will be +∞.
Example 15.4. The eccentricities be

(1) V ertex, 1 :, 1
(2) V ertex, 2 :, 2
(3) V ertex, 3 :, 2
(4) V ertex, 4 :, 2
(5) V ertex, 5 :, 2
One can see that diameter of given graph is two and radius is one. It is
clear that 4-cycle sub-graph in the graph (see Fig. 16(b)). It is greatest
cycle so the circumference of the graph is four. There are many 3-cycles in
the graph (here is example (1, {1, 2}, 2, {2, 4}, 4, {4, 1}, 1)). The minimum
possibly cycle is a 3-cycle. So girth of the graph is three. Fig. 16. Graph
The diameter and radius of graph is 2 and 1 respectively. It’s girth is three
and its circumference is four.
16
1
2
Figure 16: Graph
16 More on Trails and Cycles

Definition 16.1.
w = (v1 e1 , v2 , ..., vm , em , vm+1 )
If n ∈ {1, ..., m} and j ∈ Z we have vn = vn+j .
Then w0 = (vn , en , ..., en+j ..1, vn+j ) be closed sub-walk of w. The walk w8 can
be deleted to get another walk:
w88 = (v1 , e1 , v2 , ..., vn+j , en+j , vn+j+1 , ..., vm , em , vm+1 )
that is smaller than real walk. This is explained in Fig. 17.

Fig. 17.
Fig. 18.
17 Acyclic Graph
Definition 17.1. A graph G is said to be acyclic if it contains no cycles.
Consider a graph G is acyclic. G is said to be forest if it has more than one
component. G is said to be tree if it has one component.
17
5
6
4
1 2 3 7 8 1 2 3 7 8
Figure 17: Graph
1 2 3
4 5 6 7
Figure 18: A bipartite graph
Example 17.2. We can see a tree having 10 vertices in Fig. 30. It is

necessary a tree must be seen as a real one growing from the downward to
upward.
Fig. 30. A tree.
18 Special Matrices and Vectors

Definition 18.1. Suppose that a matrix D ∈ Rn×n be a matrix. The matrix
D is symmetric if D = DT .
18
1
2 3
6 10
9
7
4
Figure 19: A tree
19 Invertible Matrix
Definition 19.1. Suppose a square matrix B ∈ Rn×n . If B −1 such that
BB −1 = B −1 B = In
then A is called invertible with inverse B −1 . Otherwise it is said to be

singular.
19
Chapter 3
Graph Labeling
This chapter is consist of basic concept that will used in the upcoming
topics. Graph labeling is introduced in mid of 1960s, and developed in the
different labeling types.
We discuss only finite graphs in this chapter. Also the graphs discuss
in the chapter are simple as well as undirected. The order |v| = p and size
|E| = q of the graph where v are vertices and E are set of edgess.
A labeling is consist of mapping that connected with seet of nos. Two
types will be discussed vertex and edge labeling on the basis of vertex and
edges. Also the labeling is said to be total labeling if it is labeled both
edgewise and vertexwise. These are connected with the research of Rosa
[32] in 1967, or Graham and Sloane [?] in 1980.
This is based on the elements condition. Which will be explained in the
thesis.
20 Super Edge-Antimagic labeling

Now we will discuss the basic condition for super (c, d)-EAT.
Lemma 4.3.1 Consider a graph having n order with e size is super (c,
d)-EAT labeled graph then
2m + e − 5
d≤
e−1
Proof. Consider ∃ a bijection mapping α : V ∪ E −→ {1, 2, ..., m + e} be
super (c, d)-EAT, and W = {wt(yz) : wt(yz) = α(y)α(z) + α(yz), yz ∈ E}
= { c, c + d, c + 2d, ..., c + (e - 1)d} edge weights. Clearly least possible e
weight contained in super (a, d)-EAT labeling is minimum m + 4. Obviously,
a ≥ m + 4. Similarly, the largest possible edge weight is maximum 3m + e
- 1.
20
c + (e - 1)d ≤ 3m + e - 1
and
2m + e − 5
d≤
e−1
Cycles Cm with even number of vertices cannot admit super (c, 0)-EAT or
super (c, 2)-EAT labeling. The complete result for super (c, d)-EAT labeling
for Cm is presented in Section 4.6.
Theorem 20.1. [10] Let G be a regular odd degree (q, r) graph. If q ≡ 2
(mod 4) and q ≡ 0 (mod 2) then G is not super (a, d) -EAT for every odd d.
Proof. Consider G be super (a, d) - EAT with odd degree vertices of G. In
the calculation of the edge-weights, every edge labelonly one time used and
each label of vertex υ ∈ V (G) deg(υ) times used.
so
q+r
X X X
(deg(v).f (v)) + (j) = (w(e))
v∈V (G) j=q+1 e∈E(G)
X q(q + 1) q
(deg(v) − 1).f (v) + = [2(a − q − 1) + (r − 1)(d − 1)]
2 2
v∈V (G)
Clearly q ≡ 2 (mod 4) r even and d odd, then L.H.S of the equation is odd
but R.H.S of equation is even, a contradiction.
Lemma 20.2. [33]. Let < = {b, b + 1, b + 2, ...b + j} be a sequence, j is
even, then ∃ a permutation q(<) such that
< + q(<) = {2b + 2j , 2b + 2j + 1, 2b + 2j + 2, ..., 2b + 3j2 − 1, 2b + 3j2 }.
Proof. Let < = {bi : bi = b + (k − 1), 1 ≤ k ≤ j + 1} and j even.
Define Π(<) = {bk : 1 ≤ k ≤ j + 1} of the elements of < as
(
b + 2j + 1−k
2
, if, i, is, odd, 1 ≤ k ≤ j + 1
(bk ) = 2−k
b + j + 2 , if, i, is, even, 2 ≤ k ≤ j
By direct computation, we obtain that
< + (<) = {ck + ak : 1 ≤ k ≤ j + 1} = {2b + 2j + k−1
Q
2
: k, odd, 1 ≤ k ≤ j +
1}∪{2b+j + k2 : keven, 2 ≤ k ≤ j} = {2b+ 2 , 2b+ 2 +1, ..., 2b+ 3j2 −1, 2b+ 3j2 }
j j
and we arrive at the desired result.
21
Lemma 20.3. [33] Let = be a sequence = = {b, b + 1, b + 2, ...b + j−3 2
,b +
j+3 j+5
2
, b + 2 , ..., b + j + 1}, j odd. Then ∃ sequence = of the integers
{1, 2, 3, ..., j + 1}, s.t the sequence = + < consists of consecutive integers.
Proof. Consider j is odd, j ≥ 1, and consider the sequence

= = {qk : qk = b − 1 + k, 1 ≤ k ≤ j+1
2
} ∪ {qk : qk = b + k, j+3
2
≤ k ≤ j + 1}.
There arise three cases.
First case.
j + 1 ≡ 2(mod6). For j ≥ 1, we define < = {pk : 1 ≤ k ≤ j + 1} as follows.
 j−1
 j + 1 − 2k, if, k ≡ 1(mod3), and, 1 ≤ k ≤ 2

(pi ) = j + 1 − 2k, if, k ≡ 2(mod3), and, 2 ≤ k ≤ j−1 2
 j−1
j + 1 − 2k, if, ≡ 0(mod3), and, 3 ≤ k ≤ 2

(
j+1
j + 1, if, k = 2
(pk ) =
j, if, k = j+3
2
 j+5
 2j + 1 − 2k,
 if, k ≡ 0(mod3), and, 2
≤k ≤j−1
j+7
(pk ) = 2j + 1 − 2k, if, k ≡ 1(mod3), and, 2
≤k≤j
 j+9
2j + 4 − 2k, if, k ≡ 2(mod3), and, ≤k ≤j+1

2
Second case:
j + 1 ≡ 4(mod6) For j ≥ 3, using < = {pk : 1 ≤ k ≤ j + 1}.
(
j + 1, if, k = 1
(pk ) =
j, if, k = j+12
 j−1
 j + 4 − 2k, if, k ≡ 1(mod3), and, 4 ≤ k ≤ 2

(pk ) = j + 1 − 2k, if, k ≡ 2(mod3), and, 2 ≤ k ≤ j−1
2

k + 1 − 2k, if, k ≡ 0(mod3), and, 3 ≤ k ≤ j−1

2
 j+5
 2j + 4 − 2k, if, k ≡ 1(mod3), and, 2 ≤ k ≤ j + 1

(pk ) = 2j + 1 − 2k, if, k ≡ 2(mod3), and, j+7
2
≤k ≤j−1
 j+3
2j + 1 − 2k, if, k ≡ 0(mod3), and, 2 ≤ k ≤ j

3rd Case:
j + 1 ≡ 0 For j ≥ 5, we construct the < = {pk : 1 ≤ k ≤ j + 1} in the
22
following way. 


 j, if, k=1




 j − 2, if, k = 2
if, k = j+1

 j + 1,
2
(pk ) =


 j − 3, if, k = j+3
2
j+5
j − 1,




 if, k = 2
 j − 4, if, k = j+7

2
 j−1
 j + 1 − 2k, if, k ≡ 1(mod3), and, 4 ≤ k ≤ 2

(pk ) = j + 4 − 2k, if, k ≡ 2(mod3), and, 5 ≤ k ≤ j−1
2

j + 1 − 2k, if, k ≡ 0(mod3), and, 3 ≤ k ≤ j−1

2
 j+9
 2j + 1 − 2k, if, k ≡ 1(mod3), and, 2 ≤ k ≤ j + 1

(pk ) = 2j + 1 − 2j, if, k ≡ 2(mod3), and, j+11
2
≤k≤j
 j+13
2j + 4 − 2k, if, k ≡ 0(mod3), and, 2 ≤ k ≤ j + 1

We can easily see, in all cases, the sequence = + < consecutive integers.
Theorem 20.4. [7] (i), For n odd, m ≥ 3, the cycle Cm has super (2m +
2, 1)-EAT labeling and super ( 3m+5
2
, 2)-EAT labeling.
(ii) For n even, m ≥ 4 , the cycle Cm has super (2m + 2, 1)-EAT labeling.
Proof. Let Cm be defined by V (Cm ) = {υ1 , υ2 , ..., υm } and

E(Cm ) = {υk υk+1 : k = 1, 2, .., m − 1} ∪ {υm υ1 }.
Case(i). If n = odd value, then the construction gives a super ( 3m+5
2
, 2)-EAT
labeling f2 .
(
k+1
2
, if, i, is, odd, 1 ≤ k ≤ m
f1 (vk ) = n+k+1
2
, if, k, is, even, 2 ≤ k ≤ m − 1
f1 (vk vk+1 ) = m + 1 + k, if, 1 ≤ k ≤ m − 1
f1 (vm v1 ) = m + 1
f2 (vk ) = f1 (vk ), f or, 1 ≤ k ≤ m
23
1 13
14
5
4 12
8
2
7 11
9 6
3
10
Figure 20: (19, 0)-EAT labeling of C7
(
1−k
2m + 2
, if, k, is, odd, 1 ≤ k ≤ m − 2
f2 (vk+1 ) = 3m+1−k
2
, if, k, is, even, 2 ≤ k ≤ m − 1
3m + 1
f2 (vm v1 ) =
2
Case(ii).If m is even, then construction gives a super (2m + 2, 1)-EAT label-
ing.
f3 (υk ) = k, F or, 1 ≤ k ≤ m
f3 (υk υk+1 ) = 2m + 1 − k, , F or, 1 ≤ k ≤ m − 1
f3 (υm υ1 ) = m + 1.
24
18
14 1
6
13
5
2
10
17
9
7
15 12
4
3
11 8 16
21 Cycle with chord

If m = odd, we can check only to either p odd or p even;
if m is even p ≤ m2 . Consider the endpoint of the chord a and b.
Then y + x, under a super (a, d)-EAT labeling.
p
Theorem 21.1. [8] Let Cm , m ≥ 4, p ≥ 2, be super (a, b)-EAT.
(i) If d is equal to 0 and m = 2j then y + x = 2j + 1 and a = 5j + 2.
(ii) If d is equal to 0 and m = 2j + 1 then either y + x = j = 1 , a = 5j + 4
or y + x = 3j + 3 , a = 5j + 5.
(iii) If d is equal to 1 then y + x = m + 1 and a = 2m + 2.
(iv) If d is equal to 2 and m = 2j then y + x = 2j + 1 , a = 3j + 2.
(v) If d is equal to 2 and m = 2j + 1 so y + x = j + 1, a = 3j + 3 or
y + x = 3j + 3 and a = 3j + 4.
p
Proof. Suppose that Cm , m ≥ 4, p ≥ 2, has a super (a, d)-EAT labeling
p p
h : V (Cm ) ∪ E(Cm ) −→ {1, 2, ...2m + 1}
25
p
and W = {w(vu) : w(vu) = h(v) + h(u) + h(vu), vu ∈ E(Cm )} = {a, a +
d, .., a + md}.
2
we have 5m +7m+2
2
+ y + x = (m + 1)a + (m+1)m
2
d. we have
5m + 2 y+x m
a= + − d
2 m+1 2
Let us consider three cases.
1st Case. dis0
y+x
If m is even, m = 2j, then a = 5j + 1 + 2j+1 .
It will be integer for y + x ≡ 0 (mod 2j+1).
Then condition 1 ≤ y, x ≤ 2 ⇒ y + x = 2j + 1. consequently, a = 5j + 2.
y+x
If m = odd, m = 2j + 1, , then a = 5j + 27 + 2j+2 .
1 ≤ y, x ≤ j +1,we have either = y+x = j +1 and a = 5j +4 or y+x = 3j +3
and a + 5j + 5.
2nd Case. dis1
y+x
thus a = 2m + 1 + m+1 . using condition 1 ≤ y, ≤ m, it is clear that a is an
integer iff
y + x = m + 1. Thus a = 2m + 2.
3rd Case. disequal2
y+x
If m is even m = 2j, then a = 3j + 1 + 2j+1 if is an integer if y + x ≡ 0 (mod
2j +1).
The condition 1 ≤ y, x ≤ 2j implies y + x = 2j + 1 and a = 3j + 2.
y+x
When m is odd, m = 2j + 1 we get a = 3j + 25 + 2j+2 .
Since 1 ≤ y, x ≤ 2j +1, either y+x = j +1 and a = 3j +3 and a = 3j +4.
Following [29].
22 Proposition
p
Proposition[29] Every C4k+3 , k ≥ 1, has a super (a, o)-EAT labeling, ∀ p,
with a = 10k + 9, or, a = 10k + 10.
26
p
Proposition [29] Every C4k+1 , k ≥ 3, has a super (a, o)-EAT label-
ing, with a = 10k + 4, or, a = 10k + 5. , for every p other than p =
5, 9, 4k − 4, 4k − 8.
p
Proposition [29] Every C4k+1 , m ≥ 1, has a super (10k + 2, 0)-EAT la-
beling, ∀ p ≡ 2(mod4).
p
Proposition [29] Every C4k+1 , k ≥ 4, has a super (10k + 7, 0)-EAT
labeling, ∀ p ≡ 3(mod4) and for p = 2, 6.
Theorem 22.1. [8] For k ≡ 0 (mod 4), k ≥ 4, and ∀ p ≡ 2(mod 4), the
graph Ck has
(i) a super ( 5k
2
+ 2, 0) -EAT labeling, and
3k
(ii) a super ( 2 + 2, 2) -EAT labeling.
Proof. Case(i).
Clearly Ckh , k ≡ 0, (mod4), k ≥ 4, has a super ( 3k
2
, 2) -EAT labeling,
∀ h ≡ 2, (mod4).
1 1 1
5 9
7 9 5
4
7 4
4 7
3
2
2 3
3 2
6
5 8 6 8 6
Figure 22: EAT labeling
1 6 6
11 11
5 7 7
9
5 5
1 1
7
4 10 10
8 8
2
3 4 4
2 2
8 6 3 3
9 9
27
6 6 11 1 14
11 11
7
7
4
5 5
1 5
1 8
10
10 15
10 11 7
8 8
2
4 4 12
2 2 3 13
3 3
9 9 6
9
10 1 11
5
17 6
8 12
16
2
4 13
9
15 3
7
14
Theorem 22.2. [8] For k even, k ≥ 6, and, f or, h, odd, h ≥ 3, the graph
Ck has a super 2k + 2, 1-EAT labeling.
Proof. Define a bijection g6 : V (Ck ) ∪ E(Ck ) −→ {1, 2, ..., 2k + 1},

such that g6 (υm ) = 1, f or, m = 1, 2, ..., k
g6 (υm υm+1 ) = 2k + 1 + mf orm = 1, 2, ..., k − 1
g6 (υn υ1 ) = k + 1, g6 (chord) = 2k + 1
28
14 15
1 11 1 11
8 9
15 21
5 5
2 7
13 20
20 14
6 8
16 10 4
16
18 19
7 19 12
6
4 3
21 13
9 12 2 18
3 10
17 17
Consider the chord υm υk+1−m , f or, m = 2, 3, ..., k2 − 1. The distances of

the endpoints of the chords cover all the odd lengths 3, 5, ....k − 3. In the
cycle and the edge weight for chord in g6 (υm ) + g6 (υk+1−m ) + g6 (chord) =
(k + 1) + (2k + 1). Moreover, edge weights of all the edges in the cycle are
2k + 2, 2k + 3, 2k + 4, ..., 3k + 1. Therefore, g6 is a super (2k + 2, 1)-EAT
labeling of Ck , k even, for all odd h.
29
Chapter 4
Antimagic Labeling
There are many new research article already been introduced on (a, d)-
VAT labeling, but there accures many others topics on this labeling that
is still need to solve. Here we give some new research on the labeling and
present its description as well as its properties of different kinds of labeling
of the specific graph families. New ideas about labeling on VAE and SVAT
labelings of magic total labeling.
In this chapter we show v vertex and e edges and graph shown as G here
G be simple as well as undirected graph. The labeling is a procedure of
integers to put them in a certain condition. We consider a labeling is a
vertex labeling if there exist a set of vertices be the domain of the mapping.
Similarly an edge labeling be the set of edges in a domain of a mapping.
Recently, many labeling methods have been introduced up to one thousand
research papers. In these labeling the most common graph labelings are such
as k-labeling and (k, d)-graceful, α labeling, skolem graceful, k-equitable and
odd graceful. It is already defined in earlier chapter, the magic labeling con-
cept was introduced by Sedlaecek since 1963. Hartsfield showed the idea
of antimagic labeling and Ringel since 1989. Also first time (a,d)-vertex
antimagic edge labelin introduced by the authors Bodendiek, Nicholas et
al. and Walther in 1996. In antimagic and magic labelings, we use only
summation of a graph element. This is known as ’weight’ wt, a ∈ V , wt(a)
P.
= β(a)+2 β(ab), ∀ a ∈ V, β(a) = 0 under the edge labeling, and β(a)
y∈N (a)
6= 0 by total labeling. The wt(ab) ∈ E, by labeling β, be wt(ab) = β(a) +
β(b) + β β(ab) = 0 ∀ (ab) ∈ E, under the vertex labeling, also β(ab) 6= 0
under the total labeling. As there are so much kinds of antimagic have been
discussed.
Cycle graph Cn :
Path graph Pn :
30
Figure 27: Ladder and Triangular Ladder L6
Figure 28: Ordinary Labeling of Cn
Figure 29: Ordinary Labeling of Pn
Crown graph Cn+ :
31
Figure 30: Ordinary Labeling of Cn+
23 Super EAT labeling

Theorem 23.1. For k ∈ {1, 3, 4, 5, 7}, the friendship graph Tk has a super
(a, 0) labeling and a super (a, 2)-EAT labeling.
Theorem 23.2. [9] Every friendship graph Tk , k ≥ 1, has a super (a, 1)-
EAT labeling.
1 5
2 66 1 5
2
10
2
9
1
4 7 3
9
3
5 3 4
7
11
1 8
77 8 4 7
Figure 31: Labeling
Proof. The required labeling is g6 (c) = k + 1

g6 (xm ) = m, f or, 1 ≤ m ≤ k
32
1 5
3
15
4
11
8 2
13
12 6
14 7
10 9
Figure 32: Labeling g5 , f or, T7
g6 (ym ) = 2k + 2 − m, f or, 1 ≤ m ≤ n
(
3k + 3 − m+1
2
, if, m, is, odd
g6 (xm c) = m
4k + 3 − 2 , if, m, is, even
(
2k + 1 − m+1
2
, if, m, is, odd
g6 (ym c) = m
4k + 2 − 2 , if, m, is, even

 4k + 2 − m,
 if, 1 ≤ m ≤ k − 1
7k+5
g6 (ym c) = 2
, if, m = k, andkisodd

 5k+4
2
, if, m = k, andkiseven
Lemma 23.3. [9] The fan Fk has a (3, 1)-EAV labeling if and only if 2 ≤
k ≤ 6.
Proof. Suppose f : V (Fk ) → {1, 2, ..., k + 1} is an (a, 1) -EAV labeling.

Clearly the least possible edge weight in an (a, 1)-EAV labeling is minimum
33
1 + 2. Consequently, a ≥ 3. Also the greatest edge weight is no more than
k + (k + 1).
Thus
a + (e − 1) = a + 2k − 2 ≤ 2k + 1
and a ≤ 3. Therefore, a = 3.
Now 3 cases.
Case 1. If f (c) = 1 than the edge weights of edge cxm , 1 ≤ m ≤ k, are

3, 4, 5, ...., k + 2 and the edge weights of edges xm , xm+1 , 1 ≤ m ≤ k − 1 are
k + 3, k + 4, .., 2k + 1. In the computation of the edge weights k + 3, k +
4, .., 2k + 1, the labels of vertices
xm , 2 ≤ m ≤ k − 1 are used twice each. We have
k
X
2 ((m + 1) − f (x1 )) − f (xk ) = (k + 3) + (k + 4) + ... + (2k + 1)
m=1
Consequently
4 + 5k − k 2
f (x1 ) + f (xk ) =
2
Since 5 ≤ f (x1 ) + f (xk ) ≤ 2k + 1, then it follows that k = 2, or, k = 3.
For k = 2, we, label, f1 (c) = 1, f1 (x1 ) = 2, f1 (x2 ) = 3, and, f or, k =
3, we, label, f2 (c) = 1, f2 (x1 ) = 3, f2 (x2 ) = 4, f2 (x3 ) = 2.
vertex labeling f1 and f2 are (3, 1)-EAV.
Case 2.
If f (c) = k+1 than edge weights of cxm , 1 ≤ m ≤ k are k+2, k+3, ...., 2k+1,
and the edge weights of edges
xm , xm+1 , 1 ≤ m ≤ k − 1, are 3, 4, ...., k + 1.
The edge weights 3, 4, ...k + 1 are obtained as sums of
2 different elements in the set {1, 2, ....k}, where the labels of vertices
xm , 2 ≤ m ≤ k − 1, are used twice and the labels of vertices x1 andxk are
34
2 3
3 4 2
Figure 33: Vertex labeling
used once.
k
X
2 (m − f (x1 ) − f (xk )) = 3 + 4 + ... + k + 1
m=1
and
k2 − k + 4
f (x1 ) + f (xk ) =
2
. So bounds for f (x1 ) + f (xk ) are
3 ≤ f (x1 ) + f (xk ) ≤ 2k − 1
we obtain k = 2, or, k = 3. We can find a (3, 1)-EAV labeling, for

k = 2, and, k = 3, where, f (c) = k + 1. Case 3. If f (c)j, 1 < j < k + 1,
then the labels of vertices xm , 2 ≤ m ≤ k, can be partitioned into 2 sets
35
1 2
2 1 3
Figure 34: (3, 1)-EAV labeling of F2 , (3, 1)-EAV labeling of F3
S1 = {j + 1, j + 2, ..., k + 1}. ∃ an edge xm xm+1 such that its edge weight is

w(xm xm+1 ) = 2j = s1 s2 where s1 ∈ S1 , and, s2 ∈ S2 .
Denote W1 = {3, 4, ..., j}, W2 {k + j + 2, k + j + 3, ..., 2k + 1}, and, W3 =
{w(cxm ) : 1 ≤ m ≤ k} = {j+1,j+2,..,k+j+1}
2j
as the sets of edge weights.
The sum of all the values in the set S1 (values s1 , and, f (x1 ) are used once
and the other used twice each)
is equal to the sum of the edge weights in the set
36
j−1 j
X X
W1 : 2 (m − f (x1 ) − s1 ) = n
m=1 n=3
Since f (x1 ) + s1 ≤ 2j − 3, then implies that j = 3, or, j = 4.

The sum of all the values in the set S2 (values s2 , and, f (xn )
are used once and the other used twice each) is equal to the sum of the edge
weights in the set
W2 : 2[(j+1)+(j+2)+....+(k+1)]−f (xk )−s2 = (k−j+2)+(k+j+3)+....+(2k+1)
. then we have
(3k + j + 3)(k − j)
f (xk ) + s2 = (k + j + 2)(k + 1 − j) −
2
2j + 3 ≤ f (xk ) + s2 ≤ 2k + 1 ≤
(i) If j = 3 then k = 4 or k = 5.
(ii) If j = 4 then ⇒ k = 5 or k = 6 Figure 35.
24 Super antimagic labeling of Harary graphs

Theorem 24.1. [13] For k ≥ 5, j ≥ 2, and, h ≥ 2, G ' kCkh admits a
super (8kj + 3, 1)-vertex anti-magic total labeling, provided q 6= 2h.
Theorem 24.2. The graph nCk has a super (2nk + 2, 1)-edge antimagic
total labeling of every n ≥ 2, k ≥ 3.
Theorem 24.3. The graph nCk has a super 3nk+2,1 2

-edge antimagic total
labeling iff n and k are odd n, k ≥ 3.
For more results, see [1],[11] and chapter by Gallian [12].
In full chapter we show |V (G| by q and |E(G| by r.
37
1 2 4 5
1 2 4 6 5
Figure 35: Vertex labeling
25 On Super (a, d)-EAT Labeling

Theorem 25.1. For n ≥ 2, km ≥ 3, m = 1, 2, ...., n, G ∼
= Ck1 ∪ Ck2 ∪ ... ∪ Ckn
n
P
admits super (2 (kj + 2, 1)- EAT total labeling.
j=1
Proof. Consider
k
V = {vm : 1 ≤ m ≤ ki , 1 ≤ i ≤ n}
i i
E = {vm vm+1 : 1 ≤ m ≤ ki , 1 ≤ i ≤ n}
Where index ki + 1 is taken modulo ki .

Define λ : V ∪ E → {1, 2, ...q + r}
m
X
i
λ(vm )= kj−1 + m, 1 ≤ m ≤ ki , 1 ≤ i ≤ n
j=1
38
For m = ki , 1 ≤ i ≤ n
m
X
i i
λ(vm vm+1 ) = 2q − kj−1
j=1
and
i
X
i i
λ(vm vm+1 ) = 2q − kj−1 − m, 1 ≤ m ≤ ki − 1
j=1
As all the vertices receive minimum labels, So λ is a super (2q + 2, 1) edge

antimagic total labeling.
16
23 10
11
4 3
15 17
22
24
5 2
12 9
25 14
21 18
1
6 13
8
26
20
19
7
Figure 36: Super (28, 1)-EAT labeling of C6 ∪ C7
26 On (a, d)-VAT labeling

Firstly here we show some basic results for our main theorems.
Lemma 26.1. Let h ≥ 2, and, q ≥ 5. If harary graph G ∼ = Cqh is super

(a, d) vertex antimagic total then d < 9, f or, q = 2h.
Proof. Assume ∃ a bijection
λ : V (G) ∪ E(G) → {1, 2, ...q + p}
and super (a, d)- vertex antimagic total and

X
W = {λ(v) + λ(vu) : vu ∈ E(G)} = {a, a + d, ..., a + (q − 1)d}
39
be set of vertex weights. If q 6= 2h, then least possibly vertex weight in a
super (a, d)-vertex antimagic total labeling is
1 + (q + 1) + (q + 2) + (q + 3) + (q + 4) = 4q + 11.
and largest vertex weight is no more then
q + 3q + (3q − 1) + (3q − 2) + (3q − 3) = 13q − 6.
Thus, we have
a + (q − 1)d ≤ 13q − 6
9q − 17
d≤ < 9.
q−1
If q = 2h, then least possibly vertex weight in a super (a, d)-vertex antimagic
total labeling is
1 + (q + 1) + (q + 2) + (q + 3) = 3q + 7.
and maximum possible vertex weight is no more than

5q 5q 5q 17q
q+ + ( − 1) + ( − 2) = − 3.
2 2 2 2
17q
Thus, we have a + (q − 1)d ≤ 2
− 3.
11q − 20
d≤ < 6.
2(q − 1)
Theorem 26.2. Consider p ≥ 2, qj ≥ 5, h ≥ 2, j = 1, 2, .., p, G ' Cqh11 ∪

p
h
Cqh22 ... ∪ Cqpp have sup (8 (qr + 3, 1)-VAT gives qj 6= 2hj .
P
r=1
Proof. Here is
ν = {νjs : 1 ≤ j ≤ qs , 1 ≤ s ≤ p,
40
[
s
ξ = {νjs νj+1 : 1 ≤ j ≤ qs , 1 ≤ s ≤ p} s
{νjs νj+hs
: 1 ≤ j ≤ qs , 1 ≤ s ≤ p
Where total mod qs . Now λ : ν ∪ ξ → {1, 2, ..., m + n} as

s
X
λ(νjs ) = (qr−1 + j), 1 ≤ j ≤ qs , 1 ≤ s ≤ p.
r=1
s

P


 2m − (qr − 1), j = qs , 1 ≤ s ≤ p,
 r=1
λ(νjs νj+1
s
)= Ps


 2m − (qr−1 − j), 1 ≤ j ≤ qs − 1, 1 ≤ s ≤ p.
r=1

s

P


 2m + 1 + (qr − 1), j = qs , 1 ≤ s ≤ p,
 r=1
λ(νjs νj+h
s
s
)= Ps


 2m + 1 + (qr−1 − j), 1 ≤ j ≤ qs − 1, 1 ≤ s ≤ p.
r=1

p
We have ν = {νjs : 1 ≤ j ≤ qs , 1 ≤ s ≤ p} we see νh11 has 8
P
qr + 3 and
r=1
p
P Pp p
P p
P
8 (qr +3), 8 r=1 (qr +4), ...9 (qr +2), with, c = 8 (qr +3), and, d =
r=1 r=1 r=1
p
P
1 hence λ is sup (8 qr + 3, 1)- VAT.
r=1
Theorem 26.3. p ≤ 2, qs ≥ 3, j = 1, 2, ..., p, G ' Cq1 ΠCq1 ∪ ....ΠCqp have

p
P
(2 qr + 3, 1)-VAT labe.
r=1
Proof. Here is
ε = {νjs νj+1
s
: 1 ≤ j ≤ qs , 1 ≤ s ≤ p}
ν = {νjs : 1 ≤ j ≤ qs , 1 ≤ s ≤ p}
Where qs + 1 is qs . Now λ : νΠE → {1, 2, ..., m + n} as

s
X
λ(νjs ) = 2j − 1 + 2 (qr−1 ), 1 ≤ j ≤ qs , 1 ≤ s ≤ p.
r=1
41
s
X
s
λ(νjs νj+1 ) = m + n − (2j − 2) − 2 qr−1 , 1 ≤ j ≤ qs , 1 ≤ s ≤ p.
r=1
p
We have, ν = {νjs : 1 ≤ j ≤ qs , 1 ≤ s ≤ p} and ν1p has 2
P
(qr + 3) and
r=1
p
P p
P p
P p
P
2 (qr + 3), 2 (qr + 5), ....4 (qr + 1), with, c = 2 (qr + 3), and, d =
r=1 r=1 r=1 r=1
p
P
2. Thus λ is (2 qr + 3, 2)- VAT.
r=1
Theorem 26.4. The sun graph Sq on 2q v accepts a(5q + 2, 1)-VAT label.
Proof. Sq is sun graph. Then ν(Sq ) = {ν1 , υ2 − −−, υq }Π{c1 , c2 , .., cq },

E(Sq ) = {υj υj+1 |1 ≤ j ≤ q}Π{υj cj |1 ≤ j ≤ q}. We have label λ : ν ∪ E →
{1, 2, − − −, m + n} as.
λ(νj ) = j, f or, 1 ≤ j ≤ q
λ(νj vνj+1 ) = m − j + 1, f or, 1 ≤ j ≤ q

(
m + 1, j = 1;
λ(νj cj ) =
m + n2 − j + 2, 2 ≤ j ≤ q.
(
m + n2 + 1, j = 1;
λ(cj ) =
m + n − j + 2, 2 ≤ j ≤ q.
Now we see c1 has wt 5q +2 and wt(ν) {5q +2, 5q +3, −−−, 7q +1} form seq.
a = 5q + 2 and common diff d = 1. Thus λ is (5q + 2, 1)-VAT labeling.
Theorem 26.5. If hk ≥ 3, f or, every, k = 1, 2, ..., m where m ≥ 1 are

k
disjoint union G ∼
P
= Sh1 ∪ Sh2 ... ∪ Shm admits a (2 (hk + 3, 4)-VAT labeling.
j=1
Proof. Suppose G ∼ = Sh1 ∪ Sh2 ... ∪ Shm . Then for hk ≥ 3, k = 1, 2, ..., m and
m ≥ 1, V (G) = {vi |1 ≤ ihk } ∪ {ahi k |1 ≤ ihk }andE(G) = {vihk vi+1
hk hk
|1 ≤ i ≤
hk hk
hk } ∪ {vi ai |1 ≤ ihk }. A labeling λ : V ∪ E → {1, 2, ....p + q} as under.
k−1
X m
X
λ(vihk ) = 2 (hj ) + 4 (hj − 2i + 2); i = 1, 2, ....hk , and, k = 1, 2, ..., m.
k=1 j=1
42

 k
P


 2 (tj ), f or, i = 1
 j=1
λ(ahi k ) = k−1
P
2 (h + 2i − 2), f or, i = 2, 3, ...hk


 j=1 j


 m
2 (hj ) − 2 jj=1 (tk + 1),
P P


 f or, i = hk
 j=1
hk hk
λ(vi vi+1 ) = m
P Pk−1
 j=1 (hj ) − 2 j=1 (hj − 2i + 1),
2 f or, i = 2, ...hk − 1




k
P Pk
2 (hj ) − 2 (hj − 1),



 f or, i = 1
 j=1 j=1
λ(vihk ahi k ) = m k−1
P P
2 (hj ) + 2 (hj − 2i − 3), f or, i = 2, ...hk




 j=1 j=1
Now using direct computation, we see that the vertex am hm has the weight
n
P m
P m
P m
P
2 hj +3 and the set of weights of vertices {2 hj +3, 2 hj +7, ...., 10 hj −
k=1 j=1 j=1 j=1
m
P m
P
1} form a = 2 hj + 3 with d = 4. Thus a(2 hj + 3, 4)-VAT labeling.
j=1 j=1
21
12
14 32
31 13
29 5 6
15
24 13
22
30
7 34
3
2 18
11
28 20 17
1 33 28
35 25
38
18 9
16 8
27
10
Figure 37: (21, 4) − V AT, labelingof S4 ∪ S5
43
27 ANTIMAGIC TOTAL LABELINGS FOR
UNION OF GRAPHS
27.1 Introduction
Now we prove antimagic labeling for union of graphs. For this we mostly
use the star graph. Then we will give some definitions, propositions and
theorems.
The equation that will be used much in this section is
P P P
deg(u)h(u) + h(e) = w(e)
u∈V (G) e∈E(G) e∈E(G)
This is found by Baca and Youssef.

Consider K1,s ∪ K1,t be a graph, where s≥ t. According to Dafik et al. if
K1,s ∪ K1,t = G have (a, d)-SEAMT, then
2
d≤3+
s+t−1
. Thus if s + t ≥ 4, d ≤ 3. Also proved (a, d)-SEAMT with d ≤ 2.
27.1.1 Problem
Consider K1,s ∪ K1,t s > t ≥ 2 determine if ∃ (a, 3)-SEAMT labeling.

Here we will give partial solution of this Problem.
Consider K1,s ∪ K1,t = G is union of 2 graphs and s>t.
V (K1,s ∪ K1,t ) = {b1 , m1 , m2 , m3 , ..., ms } ∪ {b2 , n1 , n2 , n3 , ..., nt }
and
E(K1,s ∪ K1,t ) = {b1 mj : 1 ≤ j ≤ s} ∪ {b2 nj : 1 ≤ j ≤ t}
44
K1,4 ∪ K1,2 have (12, 3)-SEAMT also (14, 3)-SEAMT labeling, given below.
Figure 38: (12, 3) − SEAM T, labelingof K1,4 ∪ K1,2
Now we will prove some theorems which shows s ≥ t+2, only this graph
contains (a,3)-SEAMT labeling.
27.1.2 Theorem
Consider K1,s ∪ K1,t graph with s ≥ t+2, not have (a,3)-SEAMT labeling
but s = 4 and n = 2.
Proof. As it is clear that size of K1,s ∪ K1,t is v = s + t and its order is u = s
+ t + 2. Now our hypothesis is that ∃ (a,3)-SEAMT labeling for K1,s ∪ K1,t
which is h : V ∪ E −→ {1, 2, 3, ..., u + v}. Suppose that h(b1 ) = j1 and
45
h(b2 ) = j2 . As deg(b1 ) = s, deg(b2 ) = t and deg(w) = 1 ∀ w ∈ V - b1 , b2 ,
then the eq. given on the start of this section is
u(u + 1) (u+v)(u+v+1) u(u + 1) 3v(v−1)
[ − (j1 + j2 )] + sj1 + tj2 + 2
− = av + 2
2 2
simplifying
(2s − 2)j1 + (2t − 2)j2 + s2 + t2 + 2st + 13s + 13t + 6
a= ..........(i)
2s + 2t
As the least possible edgeweight is minimum s + t + 6, so a ≥ s + t + 6.
Similarly largest will be as 4s + 4t + 5, ⇒ a ≤ s + t + 8. Hence s + t
+ 6 ≤ a ≤ s + t + 8. Suppose that there are 2 edges which contained in
K1,s ∪ K1,t having smallest and greatest weight resp. We suppose e1 incident
with b1 and e2 incident with b2 . Then
Case 1. a = s + t + 6
Put in equation (i)
(2s - 2)j1 + (2t - 2)j2 = s2 + t2 + 2st - s - t - 6................(ii)
And ω(e2 ) = a + 3(n - 1) = 4s+ 4t + 3 and thus h(e2 ) ∈ {2s + 2t, 2s + 2t +

1, 2s + 2t + 2}. h(b2 ) = j2 ∈ {s + t + 2, s + t + 1, s + t, s + t − 1}. Also ω(e1 )
= a = s + t + 6 and h(e1 ) ≥ s + t + 3.
Hence j1 = 1 or 2. If j1 = 1 and j2 = s + t + 2, so putting j2 in (ii), we
have s2 - s = t2 + 3t. As s ≥ t + 2, s2 s = s(s - 1) ≥ t2 + 3t + 2. So s2 - s
= t2 + 3t has no solution. Similarly if j1 = 1 and j2 = s + t + 1, s + t or s
+ t - 1 or if j1 = 2 and j2 = s + t + 2, s + t + 1 or s + t - 1. If j1 = 2 and
j2 = s + t, then s2 - 3s = n2 - t + 2, then we have t = 2 and s = 4.
Case 2. a = s + t + 7
Put in equation (i)
(2s - 2)j1 + (2t - 2) j2 = s2 + t2 + 2st + s + t - 6................(iii)
And ω(e2 ) = a + 3(n - 1) = 4s+ 4t + 4 and thus h(e2 ) ∈ {2s + 2t + 1, 2s +

2t + 2}. h(b2 ) = j2 ∈ {s + t + 2, s + t + 1, s + t}. Also ω(e1 ) = a = s + t +
46
7 and h(e1 ) ≥ s + t + 3.
Hence j1 = 1, 2 or 3. ∀ 9 values of j1 and j2 the given eq. which is taken
from (iii) give no solution for s and t with s ≥ t + 2.
Case 2. a = s + t + 8
If K1,s ∪ K1,t admits (s + t + 8, 3)-SEAMT labeling, then h is an (s + t +
6, 3)-SEAMT labeling that is exists only s = 4 and t = 2 by case 1.
By Theorem 27.1.2, Problem 27.1.1 reduced as:
27.1.3 Problem
Determine values of t K1,s ∪ K1,t admits an (a, 3)-SEAMT labeling.
Now we present the solution of the given problem.
27.1.4 Theorem
K1,s ∪ K1,t graph admits (a, 3)-SEAMT labeling if 1 ≤ t ≤ 16, t 6= 5, 8, 11,

14. Moreover a = 2t + 8 if t 6= 2 and a = 13 when t is equal two.
Proof. To prove this type of labeling for the given cases we present its prove
using figures which are as under:
47
48
49
50
51
52
53
54
55
28 Bibliography
References
[1] N. Alone, G. Kaplan, A. Lev, y. Roditty and R. Yuster, Dense graphs
are antimagic, J, Graph theory 47 (2004), 297-309.
[2] W. S. Andrews, Magic squares and cubes, Dover, New York, 1960.
[3] N. Alone, G. Kaplan, A. Lev, y. Roditty and R. Yuster, Dense graphs
are antimagic, J, Graph theory 47 (2004), 297-309.
[4] A. Ahmad, E. T. Baskoro and M. Imran, Total vertex irregularity
strength of disjoint union of Helm graphs, Discussiones Mathematicae
Graph Theory, 32 (2012), 427–434.
[5] M. Baca, Consecutive magic labeling of generalized Petersen graphs,
Utilities Math. 58 (2000), 237-241.
[6] M. Baca , Y. Lin, M. Miller and R. Simanjuntak, New constructions of
magic and antimagic graph labeling, Utilities. Math, 60 (2001), 229-239.
[7] M. Baca, E. T. Baskoro, R. Simanjuntak and K. A. Sugeng, Super edge
antimagic labeling of the generalized petersen graph P (n, n−1
2
), Utilities
math. 70 (2006), 119-127.
[8] M. Baca and M. Murugan, Super edge antimagic abeling of a cycle with
a chord, Austral. J. Combin. 35 (2006), 253-261.
[9] M. Baca and M. Lin, M. Miller and M. Z. Youssef, Edge antimagic graphs
Discrete math 307 (2007), 1232-1244.
[10] M. Baca and M. Z. Youssef, Further results on antimagic graph labeling
, Austral, J. combin 38 (2007), 163-172.
[11] M. Baca, Consecutive magic labeling of generalized Petersen graphs,
Utilities math. 58 (2000), 237-241.
[12] M. Baca and I. Hollander, Prime magic labeling of Kn,n , J. Franklin
Inst. 327 (1990), 923-926.
[13] M. Baca , I. Hollander and Ko-Wei lih, 2 classes of super- magic quartic
graphs, J. Combine. Math. Combine. Compute. 23 (1997), 113-120.
56
[14] M. Bača, Labellings of 2 classes of convex polytopes,Utilitas Math.
34(1988), 24 − 31.
[15] M. Bača, On magic labellings of convex polytopes, Annals Disc. Math.
51(1992), 13 − 16.
[16] E.T. Baskoro, R. Simanjuntak and M.T. Adithia, Secret Sharing
Scheme based on Magic Labeling, Proc. of the 12th National Confer-
ence on Mathematics, Bali, 23-27 July (2004), 139–145.
[17] E.T. Baskoro, R. Simanjuntak and M.T. Adithia, 2 level secret sharing
schemes based on magic labelings, Proceedings INA-CISC 2005, Indone-
sia Cryptology and Information Security, March 30-31 (2005), 151–154.
[18] G.S. Bloom and S.W. Golomb, Applications of numbered undirected
graphs, Proc. IEEE 65 (1977), 562–570.
[19] G.S. Bloom and S.W. Golomb, Numbered complete graphs, unusual
rules, and assorted applications, In: Theory and Applications of Graphs,
Lecture Notes in Math. 642. Springer-Verlag (1978), 53–65.
[20] I. Cahit, Cordial graphs: a weaker version of graceful and harmonious
graphs, Ars Combin.,
[21] G. Chartrand, M.S. Jacobson, J. Lehel, O.R. Oellermann, S. Ruiz and
F. Saba, Irregular ne2rks, Congr. Numer. 64(1988), 187–192.
[22] H. Enomoto, A.S. Llado, T. Nakamigawa and G. Ringel, Super edge
magic graphs, SUT J. Math. 34 (1998), 105-109.
[23] R. M. Figueroa-Centeno, R. Ichishima and F. A. Muntaner-Batle, The
place of super edge magic labeling among other classes of labeling Dis-
crete Math 231 (2001), 153-168.
[24] J. A. Gallian, A Dynamic Survey Graph labeling, Electron. J. Combin.
16 (2013), # DS6.
[25] S. W. Golomb, How to number a graph, Graph Theory and Computing,
R.C. Read Ed., Academic Press, New York (1972), 23–37.
[26] B. Hartnell and D. Rall, A vertex-magic edge labeling game, Congr.
Numer. 161 (2003), 163–167.
[27] N. Hartsfield and G. Ringel, Pearls in Graph Theory, Academic Press,
Boston - San Diego - New York - London, 1990.
57
[28] B. Kalantari and G.B. Khosrovshahi, Magic labeling in graphs: Bounds,
complexity, and an application to a variant of TSP, Ne2rks 28 (1996),
211–219.
[29] J. A. Macdugall and W. D. wallis, Strong edge-magic labeling of a cycle
with a chord, Austral. J. Combin 28 (2003), 215-255.
[30] T. Mitchell and B. Kalantari, Magic labeling and its relationship to the
traveling salesmen problem, DIMACS REU, Summer 2001.
[31] A. Kotzig and A. Rosa Magic Valuations of finite graphs, Canad. Math,
Bull. 13 (1970), 451-461.
[32] A. Rosa, On certain valuations of the vertices of a graph, Theory of
Graphs, Internat. Symposium, Rome, July 1966, Gordon and Breach,
N.Y. and Dunod Paris (1967), 349–355.
[33] K.A. Sugeng, M.Miller, Slamin, M. baca, (a, d) edge antimagic total
labeling of caterpillers, Lecture notes in computer science 3330 (2005),
169-180.
[34] J. Sedláček, Problem 27, In: Theory and Its Applications, Proc. Symp.
Smolenice, 1963, 163–169.
[35] B.M. Stewart, Magic graphs, Can. J. Math. 18 (1966), 1031–1056.
[36] W. D. Wallis, Magic Graphs, Birkhäuser, Boston - Basel - Berlin, 2001.
58

Aph PDF

Hochgeladen von

Dokumentinformationen

Originalbeschreibung:

Originaltitel

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

Aph PDF

Hochgeladen von

Copyright:

Verfügbare Formate

Antimagic Labelling And its

Characteristics in Higher Order

Sajid Mahboob Alam

Faculty of Basic Sciences and Mathematics

MINHAJ UNIVERSITY LAHORE

Sajid Mahboob Alam

A THESIS SUBMITTED IN PARTIAL FULFILLMENT OF THE

Dr. Imran Siddique

MINHAJ UNIVERSITY LAHORE

I, Mr. Sajid Mahboob Alam Registration No. 19 student at Depart-

”Antimagic Labelling and its characteristics in higher order

is my own work and the work.

Dated Signatureof Deponent

Dated: Aug. 2018

Supervisor: Dr. Imran Siddique

External: External Examiner

5 Elementary Graph Properties 9

8 Types of Graphs from Degree Sequences 11

13 Hamiltonian / Eulerian Graph 14

14 Path / Cycle Graph 15

15 More Graph Properties: Diameter, Radius, Circumference

16 More on Trails and Cycles 17

18 Special Matrices and Vectors 18

20 Super Edge-Antimagic labeling 20

21 Cycle with chord 25

23 Super EAT labeling 32

24 Super antimagic labeling of Harary graphs 37

25 On Super (a, d)-EAT Labeling 38

26 On (a, d)-VAT labeling 39

27 ANTIMAGIC TOTAL LABELINGS FOR UNION OF GRAPHS 44

My brother Dr. Abid Mahboob supervised me in the respective sub-

I would like to thank my fellows and friends who support me in my stud-

Okara, Pakistan 2018 Sajid Mahboob Alam

1 Graph Theory History

A graph consist of vertices and edges. A graph is labelled or unlabelled.

The antimagic graph notion introduced by Ringel and Hartsfield in [27].

In 1987, Cahit [20] found a variation of both harmonious and graceful

1. The objects which holds this property.

3. Have we applications of this type of property?

First question lead us to develop an idea of new theory which is graph

Mostly this research based on the development Rosa’s research. Rosa

We use standard notations and symbols for this thesis.

First Chapter consist of preliminaries notations and history of the theory of

Chapter 3 have informations of known results of total edge product cordial

Definition 2.1. Suppose that G = (V, E) is a graph with vertices V and

different ways. However, commonly a graph can be represented by a figure.

Figure 3: The visual representation of G

Figure 9. The visual representation of G A graph is denoted by a figure

Figure 4. A multigraph has a pair of nodes, there can be one or more

Figure 5: (a) Directed graph (b) Directed graph with loop

Definition 4.4. Suppose that there is a graph G = (V, E) it is said to be

5 Elementary Graph Properties

Example 7.2. Graph in Fig. 8.

Theorem 7.3. Suppose G is a nonempty as well as nontrivial. Then G has

Figure 8: Degree Sequence

n − 1. So, total possibilities are n − 1 depends on the definition of isolated

8 Types of Graphs from Degree Sequences

Figure 11: (a)Highlighted Subgroup,(b)Spanning Subgroup

Figure 11. (a)Highlighted Subgroup,(b)Spanning Subgroup The sub-graph

Figure 12: (a) Cliques, (b) Independent set

e = {v2 , v1 } ∈ E 8 ⇔ {v2 , v1 }....E

Example 12.2. In Fig. 13. This is clear that complement of the G is