Integrated Intelligent Research (IIR) International Journal of Computing Algorithm

Volume: 03 Issue: 02 June 2014 Pages:107-109

ISSN: 2278-2397

On Edge Antimagic Total Labeling and Arithmetic

Progression
Mohammed Ali Ahmed1 , J. Baskar Babujee 2
1
Department of Mathematics,College of Education, University of Baghdad, Iraq.
2
Department of Mathematics, Anna University, Chennai, India.
Email: [email protected]

Abstract- An edge magic total labeling of graph with p vertices Example 2: The edge counts S1= {14, 15, 16, 17, 18}is of the
and q edges is a bijection from the set of vertices and edges to from of an arithmetic progression { m,m+a,m+2a,…,m+(n-
1, 2, 3,…,p+qsuch that for every edge the sum of the 2)a } such that m≥8 , m≡0(mod 2) ,a=1, n=(m-2)∕2 start from
label of the edges and the label of its two end vertices are 14 with jump 1 is given in fig 2.
constant . And if the sum is distinct it is said to be an edge
antimagic total labeling. In this paper, we exhibit edge
antimagic total labeling on graph structure for various
arithmetic progression.

Index Terms - graph, labeling, function, arithmetic

progression, magic labeling. Fig 2: Edge antimagic total labeling of the path P6.

I. INTRODUCTION II. ARITHMETIC PROGRESSION ON PATH

GRAPH
A graph G = (V,E) with p vertices and q edges is called total
edge magic if there is a bijection function f: VUE → {1,2,3, We provide algorithms for labeling for our results that makes
…,p+q} such that for any edge uv in E we have a constant K the flow of the proof simple.
with f(u)+f(v)+f(uv) = K . A graph G = (V,E) with p vertices
and q edges is called total edge antimagic if there is a bijection
function f: VUE→ {1,2,3,…,p+q} such that for any edge uv in Algorithm-2.3
E we have f(u)+f(v)+f(uv) is distinct [1,5]. Many people Input: The arithmetic progression of the form
worked on magic and anti magic labeling on the graph [3]. In S1 = { m,m+a,m+2a,…,m+(n-2)a} such that m≥8 ,
this paper, we will study that if we have some arithmetic pro- m≡0(mod2) ,a=1.
gression, then it can exhibit as an edge antimagic total labeling Output: Construction and edge antimagic total labeling for this
on graph structure. The minimum number we can start with it arithmetic progression as a path graph.
is 6 because the minimum sum of first three numbers is 6 Begin
(1+2+3), if the jump is 6 then we can get path graph as in the
next example (fig 1). Step 1: The vertex set V = {v i: 1≤ i≤ n} and the edge set E =
{vivi+1: 1 ≤i ≤ n-1}
Step 2: f (vi) = i, 1 ≤i ≤ n
Example 1:If Sn denotes the edge counts with the jump n, then Step 3: f (vivi+1) = 2n-i 1 ≤i≤ n-1
the edge counts of the path P6 is given in the form of an arith- End
metic progression S6= {6, 12, 18, 24, 30}. In general we can
say S6 = { m,m+a,m+2a,…,m+(n-2)a } such that m=6,a=6, Theorem 2.2 : The path Pn admit edge antimagic total labeling
start from 6 with jump 6 is given in the fig 1 . in the form of an arithmetic progression S 1 ={ m,m+a,m+2a,
…,m+(n-2)a} when m≥8 , m≡0(mod2) ,a=1, n=(m-2)∕2 .

Proof : The above algorithm 2.1 construct the arithmetic pro-

gression of the form
S1 = { m,m+a,m+2a,…,m+(n-2)a } with the path graph P n
such that n=(m-2)∕2
Let f: VUE→ {1, 2, 3,…, 2n-1} be the bijective function de-
fined as in the step 2
Fig 1: Edge antimagic total labeling of the path P6.
Then for all 1 ≤i≤ n-1
The next examples take different cases of the arithmetic pro- f (vi) + f(vi+1)+f(vivi+1) = i+i+1+2n-i
gression with different jump and different number can we start = 2n+i+1 = (2n+1) +i
on it. = (2((m-2) ∕2) +1) +i
= (m-1)+i
107
Integrated Intelligent Research (IIR) International Journal of Computing Algorithm
Volume: 03 Issue: 02 June 2014 Pages:107-109
ISSN: 2278-2397

Now using values of i we get edge counts as {m, m+1, m+2,…,

m+n-2}Which concludes that there exist an edge antimagic to-
tal labeling which is path graph for each arithmetic progression
of the form S1(jump 1).

Example 3: The edge counts S2= {14, 16, 18, 20, 22} from of Fig:4
an arithmetic progression {m,m+a,m+2a,…,m+(n-2)a} such
that m≥8 , m≡0(mod2) ,a=2, n=(m-2)∕2, start from 14 with Algorithm- 2.7
jump 2 is given in fig 3. Input: the arithmetic progression of the form S 3 =
{ m,m+a,m+2a,…,m+(n-2)a } such that m≥7,a=3.

Output: construction and edge antimagic total labeling for this

arithmetic progression as a path graph.

Begin
Fig 3 Step 1: The vertex set V = {vi: 1≤ i≤ n} and the edge set
E = {vivi+1 : 1 ≤i ≤ n-1 }
Algorithm- 2.4 Step 2: f (vi) = i , 1 ≤i ≤ n
Input: the arithmetic progression of the form Step 3: f (vivi+1) = n+i 1 ≤i≤ n-1
S2 = { m,m+a,m+2a,…,m+(n-2)a } such that m≥8 , End
m≡0(mod2) ,a=2.
Theorem 2.8 : The path Pn admit edge antimagic total labeling
Output: Construction and edge antimagic total labeling for this as the form of an arithmetic progression S 3 ={ m,m+a,m+2a,
arithmetic progression as a path graph. …,m+(n-2)a} when m≥7,a=3, n=m-4.
Begin
Step 1: The vertex set V = {vi : 1≤ i≤ n} and the edge set Proof : The above algorithm 2.7 construct the arithmetic pro-
E = {vivi+1 : 1 ≤i ≤ n-1 } gression of the form

Step 2: f (vi) = 2i-1, 1 ≤i ≤ n S3 ={ m,m+a,m+2a,…,m+(n-2)a } with the path graph Pn

Step 3: f (vivi+1) = 2n-2i 1 ≤i≤ n-1 such that n=m-4
End Let f:VUE→{1, 2, 3,…, 2n-1} be the bijective function de-
fined as in the step 2 and 3
Theorem 2.5 : The path Pn admit edge antimagic total labeling
in the form of an arithmetic progression S 2 ={ m,m+a,m+2a, Then for all 1 ≤i≤ n-1;
…,m+(n-2)a} when m≥8 , m≡0(mod2) ,a=2, n=(m-2) ∕ 2 . f (vi) + f(vi+1)+f(vivi+1) = i+i+1+n+i =n+3i+1
= m-4+3i+1 = m-3-3i.
Proof : The above algorithm 2.4 construct the arithmetic pro-
gression of the form Now using values of i we get edge counts as {m, m+3, m+6,…,
S2 = { m,m+a,m+2a,…,m+(n-2)a }with the path graph P n such m+3n-6} Which concludes that there exist an edge antimagic
that n=(m-2)∕2 total labeling which is path graph for each arithmetic progres-
sion of the form S3 (jump 3).
Let f: VUE→ {1, 2, 3,…, 2n-1} be the bijective function de-
fined as in the step 2 Example 5: Edge antimagic total labeling of the path P 6 . The
edge counts as S4= {10, 14, 18, 22, 26}from arithmetic pro-
Then for all 1 ≤i≤ n-1; gression of the form S4 = { m,m+a,m+2a,…,m+(n-2)a } such
f (vi) + f(vi+1)+f(vivi+1) = 2i-1+2(i+1)-1+2n-2i = 2n+2i that m≥8, m≡0(mod 2) ,a=4, n=m-4 , start from 10 with jump
= 2 (m-2) ∕2 +2i = m-2+2i 4 is given in fig 5.
Now using values of i we get edge counts as {m, m+2, m+4,…,
m+2n-4}

Which concludes that there exist an edge antimagic total label-

ing which is path graph for each arithmetic progression of the
form S2(jump 2) . Fig 5

Example 4: The edge coont of P6 {10, 13, 16, 19, 22} from an
arithmetic progression { m,m+a,m+2a,…,m+(n-2)a } such Algorithm- 2.10
that m≥7,a=3 , n=m-4, start from 10 with jump 3 is given in Input: The arithmetic progression of the form
fig 4. S4 = { m,m+a,m+2a,…,m+(n-2)a } such that m≥8 &
m≡0(mod2) ,a=4.

108
Integrated Intelligent Research (IIR) International Journal of Computing Algorithm
Volume: 03 Issue: 02 June 2014 Pages:107-109
ISSN: 2278-2397

Output: Construction and edge antimagic total labeling for this Begin
arithmetic progression as a path graph.
Begin Step 1: The vertex set V = { vi : 1≤ i≤ n+1} and the edge set
E = {v1vi : 2 ≤i ≤ n+1 }
Step 1: The vertex set V = { vi : 1≤ i≤ n} and the edge set Step 2: f (v1) = 1, f (vi) = 2(i-1) ;2 ≤i≤ n+1
E = {vivi+1 : 1 ≤i ≤ n-1 } Step 3: f (v1vi) = 2i-1 ;2≤i≤n+1
End
Step 2: f (vi) =
Theorem 3.3 : The star K1,n admit edge antimagic total label-
Step 3: f (vi) = i 1 ≤i≤ n ing as the form of an arithmetic progression S 4
Step 4: f (vi) = n+i-1 1 ≤i≤ n ={ m,m+a,m+2a,…,m+(n-1)a} when m=6,a=4.
Step 5: f (vivi+1) = 2i 1 ≤i≤ n-1
End Proof : The above algorithm 3.2 construct the arithmetic pro-
gression of the form S4= { m,m+a,m+2a,…,m+(n-1)a } with
Theorem 2.11 :The path Pn admit edge antimagic total labeling the star graph K1,n . Let f:VUE→ {1, 2, 3,…, n+1} be the bijec-
as the form of an arithmetic progression S4 ={ m,m+a,m+2a, tive function defined as in the step 2 and 3. Then for all
…,m+(n-2)a} when m≥8,a=4, n=m-4 . 2 ≤i≤ n+1; f (v1) + f(vi)+f(v1vi) = 1+2(i-1)+2i-1
= 4i-2.
Proof : The above algorithm 2.10 construct the arithmetic pro-
gression of the form Now using values of i we get edge counts as {6, 10, 14,…,
S4 = {m,m+a,m+2a,…,m+(n-2)a } with the path graph Pn 4n+2}that is { m,m+a,m+2a,…,m+(n-1)a}.This concludes that
such that n=m-4. there exist an edge antimagic total labeling which is star graph
for each arithmetic progression of the form S4 (jump 4).
Let f: VUE→{ 1,2,3,…,2n-1} be the bijective function de-
fined as in the step 2 and 3. IV. CONCLUSION

Then for all 1 ≤i≤ n-1 In above examples we show that it is possible to start with any
f (vi) + f(vi+1)+f(vivi+1)= i+n+i+1-1+2i = n+4i if i is odd. number and directly one can find a maximum path for a se-
f (vi) + f(vi+1)+f(vivi+1)= n+i-1+i+1+2i = n+4i = m-4+4i if i is quence of numbers. A special cases on example 1.1 and 3.1 if
even. Now using values of i we get edge counts as {m, m+4, we start from 6 and jump 6 we can get continuous path with
m+8,…, m+4n-8}. any number we needed , if we start from 6 with jump 4 we can
get continuous star with any number we needed. Our future
Which concludes that there exist an edge antimagic total label- work is to study arithmetic progression for other standard
ing which is path graph for each arithmetic progression of the graph structures. Open Problem: Given an arithmetic progres-
form S4(jump 4) . sion, staring above 6 will there exist a labeled graph whose
edge count generate it.
III. ARITHMETIC PROGRESSION ON STAR GRAPH
ACKNOWLEDGEMENTS
Example 6: The edge counts of star graph K1,11. is given as S4=
{6, 10, 14, 18, 22,26,30,34,38,42,46} in the from of an arith- Mohammed Ali Ahmed gratefully acknowledges the financial
metic progression {m,m+a,m+2a,…,m+(n-1)a} such that support from Baghdad University, Ministry of Higher Educa-
m=6,a=4, start from 6 with jump 4 is given in fig 6. tion and Scientific Research, Iraq and to Indian Council for
Cultural Relations for supporting to peruse research in Anna
University, Chennai, India.

REFERENCES
[1] J.Baskar Babujee, “Antimagic labeling on certain classes of graphs”, In-
ternational Journal of Mathematics, Acta Ciencia Indica, Vol.XXXI M,
No.4, (2005) ,1027 – 1030.
[2] J.Baskar Babujee, S. Babitha , D.Prathap,” New constructions on edge
antimagic graphs”, Applied Mathematical Sciences, Vol. 6, 2012, no. 44,
pp 2149 –2157.
[3] J.A.Gallian, A Dynamic Survey of Graph Labeling, Electronic Journal of
Combinatorics .19, # DS6, (2012).
[4] W.D. Wallis, Magic Graphs, Birkhauser, (2001).
[5] V. Yegnanarayanan, On magic graphs, Util. math, 59 (2001), 181-204
Fig 6: Edge antimagic total labeling of the star K1,11.

Algorithm- 3.2
Input: The arithmetic progression of the form
S4 ={m,m+a,m+2a,…,m+(n-1)a} such that m=6,a=4 .
Output: construction and edge antimagic total labeling for this
arithmetic progression as a star graph.
109