See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/320910044

Local edge antimagic coloring of graphs

Article  in  Far East Journal of Mathematical Sciences · November 2017

DOI: 10.17654/MS102091925

CITATIONS READS
14 329

5 authors, including:

Ika Hesti Agustin Moh Hasan

Universitas Jember iain madura
79 PUBLICATIONS   129 CITATIONS    10 PUBLICATIONS   31 CITATIONS   

SEE PROFILE SEE PROFILE

Dafik Dafik Ridho Alfarisi

Universitas Jember Universitas Jember
127 PUBLICATIONS   289 CITATIONS    55 PUBLICATIONS   73 CITATIONS   

SEE PROFILE SEE PROFILE

Some of the authors of this publication are also working on these related projects:

Multiset Dimension View project

Universitas Jember View project

All content following this page was uploaded by Ridho Alfarisi on 10 December 2017.

The user has requested enhancement of the downloaded file.

 Far East Journal of Mathematical Sciences (FJMS)
© 2017 Pushpa Publishing House, Allahabad, India
http://www.pphmj.com
http://dx.doi.org/10.17654/MS102091925
Volume 102, Number 9, 2017, Pages 1925-1941 ISSN: 0972-0871

LOCAL EDGE ANTIMAGIC COLORING OF GRAPHS

Ika Hesti Agustin1,2, Moh. Hasan1,2, Dafik1,3, Ridho Alfarisi1 and

R. M. Prihandini1
1
CGANT-University of Jember
Jember, Indonesia
e-mail: d.dafik@unej.ac.id
ikahesti.fmipa@unej.ac.id
2
Department of Mathematics
University of Jember
Jember, Indonesia
3
Department of Mathematics Education
University of Jember
Jember, Indonesia

Abstract

All graphs considered in this paper are finite, simple and connected
graphs. Let G (V , E ) be a graph with the vertex set V and the edge set
E, and let w be the edge weight of graph G. Then a bijection
f : V (G ) → {1, 2, 3, ..., V (G ) } is called a local edge labeling if for
adjacent edges e1 and e2 , w(e1 ) ≠ w(e2 ) , where for e = uv ∈ G,
w(e ) = f (u ) + f (v ). It is known that any local edge antimagic
labeling induces a proper edge coloring of G if each edge e is assigned
the color w(e ). The local edge antimagic chromatic number γ lea (G )

Received: April 3, 2017; Revised: August 13, 2017; Accepted: September 9, 2017
2010 Mathematics Subject Classification: 05C78.
Keywords and phrases: antimagic labeling, local edge antimagic coloring, local edge
antimagic chromatic number.
1926 I. H. Agustin, M. Hasan, Dafik, R. Alfarisi and R. M. Prihandini
is the minimum number of colors taken over all colorings induced by
local edge antimagic labelings of G. In this paper, we initiate to study
the existence of local edge antimagic coloring of some special graphs.
We also analyse the lower bound of its local edge antimagic chromatic
number. It is proved that γ lea ≥ Δ (G ). Furthermore, we have found
the relation between local edge antimagic chromatic number and local
vertex antimagic chromatic number which was firstly studied by
Arumugam et al. [1].

1. Introduction

We refer all definition of graphs to Chartrand and Lesniak [3], Gross et

al. [6] and Hartsfield and Ringel [7]. By a labeling of a graph, we mean any
mapping that sends some set of graph elements to a set of positive integers.
In this type of labeling, we consider all weights associated with each edge. If
all the edge weights have different values, then we call the labeling as an
antimagic labeling. There are a lot of results related to the antimagic
labeling, some of them can be found in Bača et al. [2, 9], Dafik et al. [4, 5],
Sugeng et al. [8], and also in Figueroa-Centeno et al. [10]. Meanwhile, the
research related to a coloring of a graph has been extensively studied by
many researchers and they have published many papers in reputable journals.
Recently, Arumugam et al. [1] introduced a connection between a vertex
proper k-coloring and antimagic labeling of a graph, namely a local vertex
antimagic coloring.
Let k be natural number, by an edge proper k-coloring of a graph G, we
mean a map c : E (G ) → S , where S = k , such that any two incident edges
receive different colors. The chromatic number of graph denoted by γ (G ) is
least number of colors necessary to color each edge of such that no two edges
incident on the same vertex have the same color. By the local vertex
antimagic coloring, Arumugam et al. [1] define as follows: A bijection f :
E (G ) → {1, 2, 3, ..., E (G ) } is called a local antimagic labeling if for any
two adjacent vertices u and v, w(u ) ≠ w(v ) , where w(u ) = ∑e∈E (u ) f (e),
and E (u ) is the set of edges incident to u. Thus any local antimagic labeling
 Local Edge Antimagic Coloring of Graphs 1927

induces a proper vertex coloring of G, where the vertex v is assigned the

color w(v ). The local antimagic chromatic number γ la (G ) is the minimum
number of colors taken over all colorings induced by local antimagic
labelings of G. Arumugam et al. [1] found the lower bound and upper bound
of local antimagic vertex coloring of joint graph and also gave the exact
value of local antimagic vertex coloring for path, cycle, complete graph,
friendship, wheel, bipartite and complete bipartite.
In this paper, we initiate to study a different type of local antimagic
coloring, namely local edge antimagic coloring. By local edge antimagic
coloring, we mean a bijection f : V (G ) → {1, 2, 3, ..., V (G ) } is called a
local edge antimagic labeling if for any two incident edges at the same
vertices e1 and e2 , w(e1 ) ≠ w(e2 ) , where for e = uv ∈ G , w(e ) = f (u ) +
f (v ). Thus, any local edge antimagic labeling induces a proper edge
coloring of G if each edge e is assigned the color w(e ). The local edge
antimagic chromatic number γ lea (G ) is the minimum number of colors taken
over all colorings induced by local edge antimagic labelings of G.
We will study the existence of local edge antimagic coloring of some
special graphs and also analyse the lower bound of its local edge antimagic
chromatic number. It is proved that γ lea ≥ Δ(G ). Furthermore, we have
found the relation between local edge antimagic edge chromatic number and
local vertex antimagic chromatic number. In [1], the authors found the
following observations which are important for this study.

Observation 1.1 [1]. For any graph G, χ la (G ) ≥ χ(G ) , where χ(G ) is a

chromatic number of vertex coloring of G.
Observation 1.2 [1]. Every connected graph is local antimagic.
We also have the following observations.

Observation 1.3. For any graph G, γ lea (G ) ≥ γ (G ) , where γ (G ) is a

chromatic number of edge coloring of G.

Observation 1.4. For any graph G, γ lea (G ) ≥ χ la (G ) − 1.

1928 I. H. Agustin, M. Hasan, Dafik, R. Alfarisi and R. M. Prihandini

2. Main Results

In this paper, we studied the existence of local edge antimagic coloring

of some special graphs, and found the local edge antimagic chromatic
number of path Pn , cycle graph Cn , friendship graph F n , ladder graph Ln ,
star graph S n , wheel graph Wn , complete graph K n , prism graph Prn and
the graphs Cn : mK1 and G : mK1. We also analyse the lower bound of
its local edge antimagic chromatic number. It has been proved that
γ lea ≥ Δ(G ). Furthermore, we have found the relation between local edge
antimagic chromatic number and local antimagic vertex chromatic number.

Theorem 2.1. If Δ (G ) is maximum degrees of G, then we have γ lea (G )

≥ Δ(G ).

Proof. Let f be any local antimagic labeling of G. For the coloring

induced by f, the color of an edge uv is assigned by f (u ) + f (v ). If v is a
vertex which is incident with Δ (G ) edges, then there must be at least Δ (G )
edges colors to be a proper edge coloring. Hence, all the edges receive
distinct colors, thus, γ lea (G ) ≥ Δ (G ). ~

With this theorem in hand, we will determine the exact values of local
edge antimagic coloring of some special graphs in the following theorems.
Theorem 2.2. For n ≥ 3, the local edge antimagic chromatic number of
Pn is γ lea ( Pn ) = 2.

Proof. The graph Pn is a connected graph with vertex set V ( Pn ) =

{xi : 1 ≤ i ≤ n} and edge set E ( Pn ) = {xi xi +1 : 1 ≤ i ≤ n − 1}. The cardinality
of vertices V ( Pn ) = n and the cardinality of edges E ( Pn ) = n − 1. Define
a bijection f : V ( Pn ) → {1, 2, 3, ..., V ( Pn ) } by

⎧i + 1 , if i is odd,
⎪
f ( xi ) = ⎨ 2
⎪n − i − 2 , if i is even.
⎩ 2
 Local Edge Antimagic Coloring of Graphs 1929

It is easy to see that f is a local antimagic labeling of Pn and the edge

weights are as follows:

⎧n + 1, if i is odd,
w( xi xi +1 ) = ⎨
⎩n + 2, if i is even.

Hence, from the above edge weights, it is easy to see that f induces a
proper edge coloring of Pn and it gives γ lea ( Pn ) ≤ 2. Based on Theorem 2.1,
the lower bound is γ lea ( Pn ) ≥ Δ( Pn ) = 2. It concludes that γ lea ( Pn ) = 2. ~

Theorem 2.3. For n ≥ 3, the local edge antimagic chromatic number of

Cn is γ lea (Cn ) = 3.

Proof. The graph Cn is a connected graph with vertex set V (Cn ) =

{xi : 1 ≤ i ≤ n} and edge set E (Cn ) = {xi xi +1 : 1 ≤ i ≤ n − 1} ∪ {xn x1}.
Hence V (Cn ) = n and E (Cn ) = n. Define a bijection f : V (Cn ) →
{1, 2, 3, ..., V (Cn ) } by the following:

⎧i + 1 , if i is odd,
⎪
f ( xi ) = ⎨ 2
⎪n − i − 2 , if i is even.
⎩ 2
It is easy to see that f is a local antimagic labeling of Cn and the edge
weights for n even is

⎧n + 1, if e = xi xi +1 , i is odd, 1 ≤ i ≤ n − 1,
⎪
⎪
w(e ) = ⎨n + 2, if e = xi xi +1 , i is even, 1 ≤ i ≤ n − 1,
⎪n + 4
⎪ , if e = xn x1
⎩ 2
and for n odd is

⎧n + 1, if e = xi xi +1 , i is odd, 1 ≤ i ≤ n − 1,
⎪
⎪
w(e ) = ⎨n + 2, if e = xi xi +1 , i is even, 1 ≤ i ≤ n − 1,
⎪n + 3
⎪ , if e = xn x1.
⎩ 2
1930 I. H. Agustin, M. Hasan, Dafik, R. Alfarisi and R. M. Prihandini

Hence, from the above edge weights, it is easy to see that f induces a
proper edge coloring of Cn and it gives γ lea (Cn ) ≤ 3. Based on Theorem
2.1, the lower bound is γ lea (Cn ) ≥ Δ (Cn ) = 2. However, we cannot attain
this sharper lower bound. Suppose γ lea (Cn ) ≥ 2, the only possibility, when
n is even, and the local antimagic labeling f induces a 2-coloring of Cn . Let
c1 be the color of xi xi +1 when i is odd and let c2 be the color of xi xi +1
n(n + 1) ⎤
when i is even. Then [c1 + c2 ] = 2⎡
n
and hence c1 + c2 = 2n + 2.
2 ⎣ 2 ⎥⎦
⎢
However, if xi is the vertex with f ( xi ) = n, then the colors received by
xi xi +1 and xi +1 xi + 2 are at least n + 1 and one of them is at least n + 2.
Thus, c1 + c2 ≥ (n + 1) + (n + 2) = 2n + 3, which is a contradiction. Hence,
Cn is γ lea (Cn ) ≥ 3. It completes that γ lea (Cn ) = 3. ~

Theorem 2.4. For n ≥ 2, the local edge antimagic chromatic number of

F n is γ lea (F n ) = 2n + 1.

Proof. Friendship graph F n of the central vertex x and the pendant

vertices xi and yi is a connected graph with vertex set V (F n ) = {x, xi ,
yi : 1 ≤ i ≤ n} and edge set E (F n ) = {xxi : 1 ≤ i ≤ n} ∪ {xyi : 1 ≤ i ≤ n} ∪
{xi yi : 1 ≤ i ≤ n}. The cardinality of vertices V (F n ) = 2n + 1 and E (F n )
= 3n. Define a bijection f : V (F n ) → {1, 2, 3, ..., F ( F n ) } as follows:

⎧1, if u = x,
⎪
f (u ) = ⎨i + 1, if 1 ≤ i ≤ n,
⎪2n − i + 2, if 1 ≤ i ≤ n.
⎩

It is easy to see that f is a local antimagic labeling of F n and we have the

edge weights as follows:

⎧2n − i + 3, if e = xyi , 1 ≤ i ≤ n,
⎪
w(e ) = ⎨i + 2, if e = xxi , 1 ≤ i ≤ n,
⎪2n + 3, if e = xi yi , 1 ≤ i ≤ n.
⎩
 Local Edge Antimagic Coloring of Graphs 1931

Hence, from the above edge weights, f induces a proper edge coloring of
F n , and we have F n is γ lea (F n ) ≤ 2n + 1. Based on Theorem 2.1, the
lower bound is γ lea (F n ) ≥ Δ (F n ) = 2n. However, we cannot attain this
bound. We can describe the reasons as follows:

(a) That vertices xi and yi , for 1 ≤ i ≤ n, are vertices adjacent to the

central vertex x. If we assign different labels to all pendants apart
from f ( x ) = 1, then the edges xxi and xyi have edge weight w( xxi )
= i + 1, w( xyi ) = 2n − i + 3 for 1 ≤ i ≤ n.

(b) In point (a), all vertices in F n apart from central vertex x has
different colors and edge weight of xxi and xyi at most 2n-coloring.
Thus, there exists a local antimagic labeling f that induces a
2n-coloring of F n such that the colors received by the edges xi yi
are at most 2n-coloring. Furthermore, the edge xi yi is an edge
incident to the edges xxi and xyi , it implies there are at least two
edges that have same color which is a contradiction.

From both cases we conclude that the lower bound of the local edge
antimagic chromatic number of F n is γ lea (F n ) ≥ 2n + 1. Hence, γ lea (F n )
= 2n + 1. ~

Theorem 2.5. For n ≥ 2, the local edge antimagic chromatic number of

Ln is γ lea ( Ln ) = 3.

Proof. The graph Ln is a connected graph with vertex set V ( Ln ) =

{xi : 1 ≤ i ≤ n} ∪ {yi : 1 ≤ i ≤ n} and edge set E ( Ln ) = {xi xi +1 : 1 ≤ i ≤ n − 1}
∪ { yi yi +1 : 1 ≤ i ≤ n − 1} ∪ {xi yi : 1 ≤ i ≤ n}, thus the cardinality of vertices
V ( Ln ) = 2n and the cardinality of edges E ( Ln ) = 3n − 2. Define a
bijection f : V ( Ln ) → {1, 2, 3, ..., V ( Ln ) } by the following:

⎧i, if i is odd,
f ( xi ) = ⎨
⎩2n − i + 1, if i is even,
1932 I. H. Agustin, M. Hasan, Dafik, R. Alfarisi and R. M. Prihandini

⎧i, if i is even,
f ( yi ) = ⎨
⎩2n − i + 1, if i is odd.

Clearly f is a local antimagic labeling of Ln and we formulate the edge

weights as follows:

⎧ 2 n, if e = xi xi +1 , i is odd; e = yi yi +1 , i is even; 1 ≤ i ≤ n − 1,
⎪
w(e ) = ⎨2n + 1, if e = xi yi , 1 ≤ i ≤ n,
⎪2n + 2, if e = x x , i is even; e = y y , i is odd; 1 ≤ i ≤ n − 1.
⎩ i i +1 i i +1

Hence, the above edge weights, f induces a proper edge coloring of Ln ,

and it gives γ lea ( Ln ) ≤ 3. Based on Theorem 2.1, the lower bound is
γ lea ( Ln ) ≥ Δ( Ln ) = 3. It concludes that γ lea ( Ln ) = 3. ~

Theorem 2.6. For n ≥ 3, the local edge antimagic chromatic number of

Sn is γ lea ( Sn ) = n.

Proof. The star Sn is a graph with central vertex x and the leaves xi , for
1 ≤ i ≤ n. The vertex set V ( Sn ) = {xi : 1 ≤ i ≤ n} ∪ {x} and the edge set
E ( S n ) = {xxi : 1 ≤ i ≤ n}. Thus V ( S n ) = n + 1 and E ( Pn ) = n. To have
local antimagic labeling, define a bijection f : V ( S n ) → {1, 2, 3, ..., V ( S n ) }
as follows:

⎧1, if u = x,
f (u ) = ⎨
⎩i + 1, if e = xi , 1 ≤ i ≤ n.

It is easy to see that f is a local antimagic labeling of Sn and we

formulate the edge weights as follows:

w( xxi ) = i + 2, if 1 ≤ i ≤ n.

Hence, from the above edge weights, f induces a proper edge coloring of
Sn . It reflexes γ lea ( Sn ) ≤ n. Based on Theorem 2.1, the lower bound is
γ lea ( Sn ) ≥ Δ( Sn ) = n. It concludes that γ lea ( Sn ) = n. ~
 Local Edge Antimagic Coloring of Graphs 1933

Theorem 2.7. For n ≥ 2, the local edge antimagic chromatic number of

Wn is γ lea (Wn ) = n + 2.

Proof. Wheel graph Wn is a graph with central vertex x and the other
vertices xi , 1 ≤ i ≤ n, are on the cycle. Thus, the vertex set V (Wn ) =
{x, xi : 1 ≤ i ≤ n} and the edge set E (Wn ) = {xxi : 1 ≤ i ≤ n} ∪ {xi xi +1 : 1
≤ i ≤ n − 1} ∪ {x1xn }. The cardinality of vertices V (Wn ) = n + 1 and the
cardinality of edges E (Wn ) = 2n. To assign local antimagic labeling, we
define a bijection f : V (Wn ) → {1, 2, 3, ..., V (Wn ) } by the following:

⎧1, if u = x,
⎪
⎪⎪ i + 3
f (u ) = ⎨ , if u = xi , i is odd,
⎪ 2
⎪n − i + 2, if u = xi , i is even.
⎪⎩ 2

It is easy to see that f is a local antimagic labeling of Wn and we have the

edge weights as follows:

⎧ i + 1 + 2, if e = xxi , i is odd,
⎪ 2
⎪ i
⎪n − 2 + 3, if e = xxi , i is even,
⎪
⎪n + 3, if e = xi xi +1 , 1 ≤ i ≤ n − 1, i is odd,
w(e ) = ⎨
⎪n + 4, if e = xi xi +1 , 1 ≤ i ≤ n − 1, i is even,
⎪n
⎪ + 4, if e = xn x1 , n is even,
⎪2
⎪ n + 3 + 2, if e = xn x1 , n is odd.
⎩ 2

Hence, from the above edge weights, f induces a proper edge coloring of
Wn , the upper bound of the local edge antimagic chromatic number of Wn is
γ lea (Wn ) ≤ n + 2. Based on Theorem 2.1, the lower bound is γ lea (Wn ) ≥
Δ(Wn ) = n. However, we cannot attain the sharpest lower bound. The
reasons are as follows:
1934 I. H. Agustin, M. Hasan, Dafik, R. Alfarisi and R. M. Prihandini

(a) All vertices xi , for 1 ≤ i ≤ n, are adjacent to the central vertex x and
the edges xxi are incident to the edge xi xi +1. If we assign different
labels to all vertices apart from f ( x ) = 1, then the edges xxi has an
i +1 i
edge weight w( xxi ) = + 2 for i is odd, and w( xxi ) = n − + 3
2 2
for i is even. Thus, the cardinality of an edge weight of edges on the
cycle are at least n and at most n + 2.

(b) A local antimagic labeling f may induce a n + 1 -coloring of Wn . Let

c1 be the color of xi xi +1 when i is odd and let c2 be the color of
n (n + 2 ) ⎤
xi xi +1 when i is even. Then [c1 + c2 ] = 2 ⎡
n
and hence
2 ⎢⎣ 2 ⎥⎦
c1 + c2 = 2n + 4. Now if xi is a vertex with f ( xi ) = n + 1, then the
colors received by xi xi +1 and xi +1 xi + 2 are at least n + 2 and one
of them is at least n + 3. Thus c1 + c2 ≥ ( n + 2) + (n + 3) = 2n + 5,
which is contradiction.

In both cases, the lower bound of the local edge antimagic chromatic
number of Wn is γ lea (Wn ) ≥ n + 2. It concludes that γ lea (Wn ) = n + 2. ~

Theorem 2.8. For n ≥ 3, the local edge antimagic chromatic number of

K n is γ lea ( K n ) = 2n − 3.

Proof. The complete graph K n is a connected graph, on the vertex set

V ( K n ) = {xi : 1 ≤ i ≤ n} and the edge set E ( K n ) = {xi xi + k : 1 ≤ i ≤ n, 1 ≤
k ≤ n − i} with the cardinality of vertices V ( K n ) = n and the cardinality
n (n − 1)
of edges E ( K n ) = . To have a local antimagicness of K n , we can
2
define a bijection f : V ( K n ) → {1, 2, 3, ..., V ( K n ) } by

f ( xi ) = i : if 1 ≤ i ≤ n.

It is easy to see that f is a local antimagic labeling of K n and the edge

weights can be expressed as
 Local Edge Antimagic Coloring of Graphs 1935

w( xi xi + k ; 1 ≤ i ≤ n, 1 ≤ k ≤ n − i ) = i + l ; 1 ≤ i ≤ n − 1, i + 1 ≤ l ≤ n.

Hence, the upper bound of the local edge antimagic chromatic number of
K n is γ lea ( K n ) ≤ 2n − 3. Based on Theorem 2.1, the lower bound is
γ lea ( K n ) ≥ Δ ( K n ) = n − 1. However, we cannot attain this sharpest lower
bound. There exists a local antimagic labeling f that induces a (2n − 4 ) -
coloring of K n . Thus, we have the edge weight namely 3 ≤ w(e ) ≤ 2n − 2,
it means that smallest edge weight of K n is 3 and the biggest edge weight of
K n is 2n − 2. Based on the local antimagic labeling f that the biggest edge
weight is w(e ) = f (u ) + f (v ) = n + n − 1 = 2n − 1, it is contradiction. Thus,
we can determine that 3 ≤ w(e ) ≤ 2n − 1 with the cardinality of edge weight
{w(e )} = {3, 4, 5, ..., 2n − 1} = 2n − 3. Hence, the lower bound of the
local edge antimagic chromatic number of K n is γ lea ( K n ) ≥ 2n − 3. It
concludes that γ lea ( K n ) = 2n − 3. ~

Theorem 2.9. For n ≥ 3, the local edge antimagic chromatic number of

Prn is γ lea ( Prn ) = 5.

Proof. The prism Prn is a connected graph with vertex set V ( Prn ) =
{xi , yi : 1 ≤ i ≤ n} and edge set E ( Prn ) = {xi yi : 1 ≤ i ≤ n} ∪ {xi xi +1 : 1 ≤ i
≤ n − 1} ∪ { yi yi +1 : 1 ≤ i ≤ n − 1} ∪ {xn x1 , yn y1}, thus V ( Prn ) = 2n and
E ( Prn ) = 3n. Define a bijection f : V ( Prn ) → {1, 2, 3, ..., V ( Prn ) } for
the graph Prn to be local edge antimagic labeling

⎧i, if u = xi , i is even,
⎪2n − i + 1, if u = xi , i is odd,
⎪
f (u ) = ⎨
⎪i, if u = yi , i is odd,
⎪2n − i + 1, if u = yi , i is even.
⎩

It is easy to see that f is a local antimagic labeling of Prn , we can have

the edge weights as follows:
1936 I. H. Agustin, M. Hasan, Dafik, R. Alfarisi and R. M. Prihandini

⎧2n + 1, if e = xi yi , 1 ≤ i ≤ n,
⎪2n + 2, if e = xi xi +1 , i is odd; e = yi yi +1 , i is even; 1 ≤ i ≤ n − 1,
⎪
⎪ 2 n, if e = xi xi +1 , i is even; e = yi yi +1 , i is odd; 1 ≤ i ≤ n − 1,
⎪⎪
w(e ) = ⎨3n, if e = xn x1 , n is even,
⎪3n + 1, if e = xn x1 , n is odd,
⎪
⎪n + 2, if e = y n y1 , n is even,
⎪
⎪⎩n + 1, if e = y n y1 , n is odd.

Hence, the upper bound of the local edge antimagic chromatic number of
Prn is γ lea ( Prn ) ≤ 5. Based on Theorem 2.1, the lower bound is γ lea ( Prn )
≥ Δ ( Prn ) = 3. However, we cannot attain this sharpest lower bound. Thus,
we need to add the following reasons:
(a) When n is even, there exists a local antimagic labeling f that induces
a 4-coloring of Prn . An edge weight of xn x1 and yn y1 are w( xn x1 )
= w( y n y1 ) = 3n and for the edge weights we have w( xi yi ) = 2n + 1
for 1 ≤ i ≤ n, and w( xi xi +1 ) = 2n, w( yi yi +1 ) = 2n + 2 for 1 ≤ i ≤
n − 1.

(b) In case (a), we have w( xn x1 ) = w( yn y1 ) = 3n. Since f is a local

antimagic labeling of Prn in which f ( y1 ) = 1 and f ( yn ) = n + 1,
we have the following edge weight:
w( yn y1 ) = f ( y1 ) + f ( yn )

= 1 + (n + 1) = n + 2

clearly that w( yn y1 ) = n + 2 < 3n, which contradicts w( xn x1 ) =

w( yn y1 ) = 3n.

(c) However, if w( xn x1 ) ≠ w( yn y1 ) , then there exists a local antimagic

labeling f that induces a 5-coloring of Prn .

In three cases, the lower bound local antimagic labeling of Prn is

γ lea ( Prn ) ≥ 5. It concludes that γ lea ( Prn ) = 5. ~
 Local Edge Antimagic Coloring of Graphs 1937

In the above theorems, we have dealt with some special graphs, from
now on we are studying the local edge antimagic coloring of graph
operations, namely a coronation of graph. For any two graphs G and H. A
coronation of G and H, denoted by G : H , is a connected graph which
formed by taking n copies of graphs H i , 1 ≤ i ≤ n of H and connecting ith
vertex of G to the vertices of H i . In next theorem, we will give an exact
value of the local edge antimagic chromatic number of the graphs Cn : mK1
and G : mK1.

Theorem 2.10. For n ≥ 3 and m ≥ 1, the local edge antimagic

chromatic number of Cn : mK1 is γ lea (Cn : mK1 ) = m + 3.

Proof. The graph Cn : mK1 is a connected graph with vertex set

V (Cn : mK1 ) = {xi : 1 ≤ i ≤ n} ∪ {xi, j : 1 ≤ i ≤ n, 1 ≤ j ≤ m} and edge set
E (Cn : mK1 ) = {x1 xn , xi xi +1 : 1 ≤ i ≤ n − 1} ∪ {xi xi , j : 1 ≤ i ≤ n, 1 ≤ j ≤ m}
with the cardinality of vertices V (Cn : mK1 ) = n(m + 1) and the cardinality
of edges E (Cn : mK1 ) = n(m + 1).

Based on Theorem 2.1, the lower bound is γ lea (Cn : mK1 ) ≥ γ lea (Cn )
+ m = 3 + m. Next, we will show that γ lea (C n : mK1 ) ≤ γ lea (C n ) + m = 3
+ m. We define a bijection f : V (Cn : mK1 ) → {1, 2, 3, ..., V (Cn : mK1 ) }
by

⎧i + 1 , if u = xi , i is odd,
⎪ 2
⎪ i−2
⎪n − 2 , if u = xi , i is even,
f (u ) = ⎨
i −1
⎪( j + 1) n − , if u = xi, j , i is odd and 1 ≤ j ≤ m,
⎪ 2
⎪ jn + i , if u = xi, j , i is even and 1 ≤ j ≤ m.
⎩ 2

It is easy to see that f is a local antimagic labeling of Cn : mK1 and the

edge weights are as follows:
1938 I. H. Agustin, M. Hasan, Dafik, R. Alfarisi and R. M. Prihandini

⎧n + 1, if e = xi xi +1 , 1 ≤ i ≤ n − 1, i is odd,
⎪
⎪n + 2, if e = xi xi +1 , 1 ≤ i ≤ n − 1, i is even,
⎪
⎪
w(e ) = ⎨( j + 1) n + 1, if e = xi xi, j , 1 ≤ i ≤ n, 1 ≤ j ≤ m,
⎪n + 3
⎪ 2 , if e = x1 xn , n is odd,
⎪n + 4
⎪⎩ , if e = x1 xn , n is even.
2
Hence, the above edge weight, it is easy to see that the upper bound of
the local edge antimagic chromatic number of Cn : mK1 is γ lea (Cn : mK1 )
≤ m + 3. It concludes that γ lea (Cn : mK1 ) = m + 3. We give the following
Figure 1 for illustration. ~

Figure 1. Local edge antimagic coloring of C8 : 3K1.

Theorem 2.11. Let G be any graph of order n ≥ 3. The local edge

antimagic chromatic number of G : mK1 is γ lea (G : mK1 ) = γ lea (G ) + m.

Proof. Let G be a graph of order n ≥ 3 and vertex set V (G ) = {ui : 1

≤ i ≤ n}. Let G : mK1 be a connected graph with vertex set V (G : mK1 )
 Local Edge Antimagic Coloring of Graphs 1939

= V (G ) ∪ {xij : 1 ≤ i ≤ n, 1 ≤ j ≤ m} and the edge set E (G : mK1 ) = E (G )

∪ {ui xij : 1 ≤ i ≤ n, 1 ≤ j ≤ m}.

Suppose G admits a local edge antimagic coloring with γ lea (G ) = s. We

define f : V (G ) → {1, 2, 3, ..., V (G ) } as the local antimagic labeling
bijection of s colors. Since every vertex of mK1 connects to every vertex in
base graph G, the edge weight of pendant vertex must be different with the
edge weight of base graph G. It implies γ lea (G : mK1 ) ≥ s + m. What is
the value of γ lea (G : mK1 ) ? To answer this problem, we need to prove that
γ lea (G : mK1 ) ≤ s + m by defining a bijection g : V (G : mK1 ) → {1, 2,
3, ..., V (G ) + mn} in the following way:

⎧ f (ui ) , if v = ui , 1 ≤ i ≤ n,
g (v ) = ⎨
⎩( j + 1) n − f (ui ) + 1, if v = xij , 1 ≤ i ≤ n, 1 ≤ j ≤ m.

It is easy to see that g is a local antimagic labeling of G : mK1 and we

have the edge weights as follows:

⎧w f (uv ) , if e = uv, u , v ∈ V (G ) ,
w g (e ) = ⎨
⎩( j + 1) n + 1, if e = ui xij , 1 ≤ i ≤ n, 1 ≤ j ≤ m.

We can easily see that wg (uv ) < wg (ui xij ) for every 1 ≤ i ≤ n, 1 ≤ j
≤ m and each label f is at most n. Thus, f (u ) < f (v ) or f (v ) < f (u ) for
u, v ∈ V (G ). The edge weight

wg (uv ) = g (u ) + g (v )

= f (u ) + f (v ) = 2n − 1
and

wg (ui xij ) = g (ui ) + g ( xij )

= f (ui ) + ( j + 1) n − f (ui ) + 1

≤ ( j + 1) n + 1.
1940 I. H. Agustin, M. Hasan, Dafik, R. Alfarisi and R. M. Prihandini

It is clear that for n ≥ 3, we have 2n − 1 < ( j + 1) n + 1. Thus for every

1 ≤ i ≤ n, 1 ≤ j ≤ m is

wg (uv ) < wg (ui xij ).

By this labeling, the edge weight of pendants is larger than the edge
weight of the base graph G. Therefore, it is easy to see that g is a local
antimagic labeling of G : mK1,
γ lea (G : mK1 ) ≤ wg (e )

= w f (uv ) + wg (ui xij )

= γ lea (G ) + m
= s + m.
Hence, from the above edge weight it is easy to see that the upper bound
of the local edge antimagic chromatic number of G : mK1 is γ lea (G : mK1 )
≤ s + m. It concludes that γ lea (G : mK1 ) = s + m = γ lea (G ) + m. ~

3. Conclusion

In this paper, we have initiated to study the local edge antimagic coloring
of special graph and its operations. We have found that most of the local
edge chromatic numbers attain the best lower bound. However, we need to
characterize more general result for any graph G, especially the connection
with the local vertex antimagic coloring of graph. Hence, the following open
problem arises naturally.
Open problem 3.1. Characterize the class of graphs G for which γ lea (G )
= χ la (G ) − 1.
Acknowledgement

We gratefully acknowledge the support from CGANT - University of

Jember of year 2017.
The authors also thank the anonymous referees for their valuable
suggestions which led to the improvement of the manuscript.
 Local Edge Antimagic Coloring of Graphs 1941

References

[1] S. Arumugam, K. Premalatha, M. Bača and A. Semanicova-Fenovcikova, Local

antimagic vertex coloring of a graph, Graphs Combin. 33 (2017), 275-285.
[2] M. Bača, M. Miller, J. Ryan and Dafik, Antimagic labeling of disjoint union of
s-crowns, Utilitas Mathematica 78 (2009), 193-205.
[3] G. Chartrand and L. Lesniak, Graphs and Digraphs, 3rd ed., Chapman and Hall,
London, 2000.
[4] Dafik, M. Miller, J. Ryan and M. Baca, Super edge-antimagic total labelings of
mK n, n , Ars Combin. 101 (2011), 97-107.

[5] Dafik, M. Miller, J. Ryan and M. Baca, On antimagic labelings of disjoint union
of complete s-partite graphs, J. Combin. Math. Combin. Comp. 65 (2008), 41-49.
[6] J. L. Gross, J. Yellen and P. Zhang, Handbook of Graph Theory, 2nd ed., CRC
Press, Taylor and Francis Group, 2014.
[7] N. Hartsfield and G. Ringel, Pearls in Graph Theory, Academic Press, United
Kingdom, 1994.
[8] K. A. Sugeng, M. Miller and M. Bača, Super edge-antimagic total labelings,
Utilitas Mathematica 71 (2006), 131-141.
[9] M. Bača, Dafik, M. Miller and J. Ryan, On super (a, d) -edge-antimagic total
labeling of caterpillars, J. Combin. Math. Combin. Comp. 65 (2008), 61-70.
[10] R. M. Figueroa-Centeno, R. Ichishima and F. A. Muntaner-Batle, The place of
super edge-magic labelings among other classes of labelings, Discrete Math. 231
(2001), 153-168.

View publication stats