SUPER (a, d) − (Fn , K2 )-ANTIMAGIC TOTAL LABELING FOR CONNECTED AND

DISCONNECTED AMALGAMATION OF FAN GRAPH WITH K2

MALLIKARJUN GHALEPPA1 , AND DANAPPA G AKKA2

1
Department of Mathematics, Sri Krishna Institute of Technology, Bengaluru - 560090,
Karnataka, India.
[email protected]
2
Department of Mathematics, Sri Krishna Institute of Technology, Bengaluru - 560090,
Karnataka, India.
[email protected]

A BSTRACT. A finite simple graph G = (V,E) where |V | = p, |E| = q, admits a (H 1 , H 11 )-

covering if every edge in E belongs to atleast one subgraph of G isomorphic to a given graph
H 1 or H 11 . An (a,d) - (H 1 , H 11 )-antimagic total labeling of G admitting an (H 1 , H 11 )-
covering is a bijective function f : V ∪ E → {1, 2, ..., p + q} such that for all subgraphs
P
H11 or H111 isomorphic H 1 or H 11 respectively, the H11 -weight w(H11 ) = v∈V (H 1 ) f (v) +
1
P 11 11
P P
1
e∈E(H ) f (e) and the H 1 - weight w(H 1 ) = 11
v∈V (H ) f (v) + 11
e∈E(H ) f (e) constitute
1 1 1

an AP {a, a + d, ..., a + (t − 1)d} where ‘a’ and ‘d’ are positive integers and t is the number of
subgraphs H11 or H111 of G isomorphic to H 1 or H 11 (|Hj1 | = |Hj11 | = t) such a labeling is
called super if the f (V ) = {1, 2, ..., p}. This is a new concept introduced by authors.
In this paper we deal with super (a,d)-(Fn , K2 ) antimagic total labeling for a connected and
disconnected amalgamation of fans Fn and edges K2 we can show that for some feasible d, a
connected and disconnected amalgamation of Fn and K2 admit a super (a,d)- Fn ∪K2 antimagic
total labeling.

Keywords:Super edge antimagic total labeling amalgamation, Total weight.

2010 Mathematics Subject Classification: Primary 05C10; Secondary 05C38.
1
2 MALLIKARJUN GHALEPPA AND DANAPPA G AKKA

1. I NTRODUCTION

All graphs considered here are finite undirected and without loops and multiple edges. The
edge magic labeling was the developed into a magic covering by Gutierrez and Llado [9] who
defined that a graph G admits an H-magic covering if every edge of E(G) belongs to subgraph
P P
H 1 that isomorphic to H satisfying w(H) = v∈V (H 1 ) f (v) + v∈E(H 1 ) f (e) = f (H) is a

constant magic sum and f (H) is a constant supermagic sum of H. If the smallest labels appear
in the vertices. This is an extension of the edge-magic labelings introduced by Kotzig and Rosa
[15] and super edge-magic labeling introduced by Enomota et.al [8]. They proved that some
classes of connected graphs such as the stars K1,n and the complete bipartite graphs Km,n are
K1,n -super magic. They also proved that the path Pn and the cycle Cn are Ph -super magic for
some h. Llado and Moragas[16] proved, that wheels, mindmills, books and prisms are Ch -
magic for some h. Maryati et.al [17] investigated the G-super magicness of a disjoint union of
any paths is C Ph -super magic for some C and h. Maryati et.al [18] and also Salman et.al [22]
show that certain families of trees are path-super magic. Ngurah, Salman and Susilowati [20]
proved that chains, wheels, triangles ladders and grids are cycle-supermagic. Other examples of
H-supermagic graphs with different choices of H have been given by Jayanthi and Selvagopal
[13,14]. Muthuraja, Selvagopal and Jeyanthi [19] showed that the square graph of bistar, path
and cycle are cycle-supermagic. They also proved that the middle graph of Cn is also C3 -super
magic. Jeyanthi and Muthuraja [12] investigated that the graph Km,n for m, n ≥ 2 is C2m -super
magic and the splitting graph of Cn is C4 -super magic for n 6= 4

Further Simanjuntak et.al [23] introduced an (a,d)-antimagic total labeling of G which is de-
fined as a bijective function f : V (G)∪E(G) → {1, 2, ..., p + q} so that the set of edge-weights
{f (u) + f (uv) + f (v)/, uv ∈ E(G)} is equal to the set {a, a + d, ..., a + (q − 1)d} for same
positive integers a and d. An (a,d)-edge-antimagic total labeling f is called super if the vertex la-
bels are the smallest possible labels. Several results related to edge-antimagic total labelings are
provided in [1,2,3,4,5,22]. Combining the two above labelings, Inayah et.al [10] introduced the
(a,d)-H-antimagic labeling. A graph G is said to be (a,d)-H-antimagic total labeling if there exist
a bijective function f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for all subgraphs H 1 iso-
P P
morphic to H, the total H-weight w(H) = v∈V (H 1 ) f (v) + e∈E(H 1 ) f (e) form an arithmetic
 3

sequence {a, a + d, ..., a + (t − 1)d} where a and d are positive integers and t is the number of
all subgraphs H 1 isomorphic to H. Such a labeling is called super if f (V (G)) = {1, 2, ..., p}.
Inayah et al [11] showed that, for H is a nontrivial connected graph and t ≥ 2 is an integer
shack (H,t) which contains exactly t subgraphs H 1 isomorphic to H is H-super antimagic. In [6]
M. Baca et. al were investigated the existence of super (a, d)-Hantimagic labeling for discon-
nected graphs. They proved that if a graph G admits a (super) (a,d)-H-antimagic labeling where
d = |E(H)| − |V (H)| then the disjoint union of m copies of the graph G denoted by mG admits
a (super) (a,d)-H-antimagic labeling as well. P. Jeyanti et. al [12] investigated with some results
on anti-balenced sets and they showed the existence of super (a,d) cycle-antimagic labeling of
fans and some square graphs. In [7], M. Baca et. al provided some sufficient conditions for
cartesian product of graphs to be H-antimagic. Admits a (H 1 , H 11 )-covering if every edge in
E belongs to atleast one subgraph of G isomorphic to a given graph H 1 or H 11 . An (a,d) -
(H 1 , H 11 )-antimagic total labeling of G admitting an (H 1 , H 11 )-covering is a bijective function
f : V ∪ E → {1, 2, ..., p + q} such that for all subgraphs H11 or H111 isomorphic H 1 or H 11
P P
respectively, the H11 -weight w(H11 ) = v∈V (H 1 ) f (v) + e∈E(H 1 ) f (e) and the H111 - weight
1 1
P P
w(H111 ) = v∈V (H 11 ) f (v) + e∈E(H 11 ) f (e) constitute an AP {a, a + d, ..., a + (t − 1)d}
1 1

where ‘a’ and ‘d’ are positive integers and t is the number of subgraphs H11 or H111 of G isomor-
phic to H 1 or H 11 (|Hj1 | = |Hj11 | = t) such a labeling is called super if the f (V ) = {1, 2, ..., p}.
This is a new concept introduced by authors.

In this paper we establish the super (a,d)-(Fn , K2 )-antimagic total labelings for connected
and disconnected amalgamation of fan Fn and singlton edge K2 . We can prove that, for some
feasible ‘d’, a connected and disconnected amalgamation of fan Fn graphs and singlton edge
K2 ’s admit a super (a,d)-(Fn , K2 ) antimagic total labeling.

A USEFUL LEMMA

We start proving lemma that will useful in the next section. This Lemma is a necessary
condition for a graph to be super (a,d)-(H 1 , H 11 )-antimagic total labeling. It gives a least upper
bound for feasible value of d.
Lemma 1.1. Let G be a simple graph. If G is super (a,d)-(H 1 , H 11 )-antimagic total labeling
4 MALLIKARJUN GHALEPPA AND DANAPPA G AKKA

then
[pG −(pH 1 +pH 11 )](pH 1 +pH 11 )+[qG −(qH 1 +qH 11 )](qH 1 +qH 11 )
d≤ t−1
.......................(I)
f or H11j and H1j 11
are subgraphs isomorphic to H 1 and H 11 respectively, pG = |V (G)|, qG =
|E(G)|, pH11 = |V (H11 )|, pH111 = |V (H111 )|, qH11 = |E(H11 )|, qH111 = |E(H111 )| and t = |H11 | =
|H111 |
Proof . Suppose that a (p,q), graph has a super (a,d)-(H 1 , H 11 )-antimagic total labeling f :
V ∪ E → {1, 2, ..., pG + qG } and the total (H 1 , H 11 )-weights
P P
W (H 1 , H 11 ) = v∈V (H 1 ,H 11 ) f (v) + e∈E(H 1 ,H 11 ) f (e) = {a, a + d, ...a + (t − 1)d}
The minimum possible total (H 1 , H 11 )-weight in the labeling f is atleast 1 + 2 + ... + (pH 1 +
(PH 1 +pH 11 ) (PH 1 +pH 11 )2
pH 11 ) + (pG + 1) + (pG + 2) + ... + (pG + qH 1 + qH 11 ) = 2
+ 2
+ pG (qH 1 +
(qH 1 +qH 11 ) (q +q )2
qH 11 ) + 2
+ H 1 2 H 11 .
(P +p ) (P +p )2 (qH 1 +qH 11 ) (qH 1 +qH 11 )2
Thus a ≥ H 1 2 H 11 + H 1 2 H 11 + pG (qH 1 + qH 11 ) + 2
− 2
.
On other hand, the maximum possible total (H 1 , H 11 )-weight is at most pG + (pG − 1) + ... +
[pG − (pH 1 + pH 11 − 1)] + (pG + qG ) + (pG + qG − 1) + ... + (pG + qG − (qH 1 + qH 11 − 1)) =
(pH 1 +pH 11 ) (pH 1 +pH 11 )2 (qH 1 +qH 11 ) (q +q )2
pG (pH 1 + pH 11 ) + 2
− 2
+ (pG + qG )(qH 1 + qH 11 ) + 2
− H 1 2 H 11 .
(pH 1 +pH 11 ) (p +p )2
So we get a + (t − 1)d ≤ pG (pH 1 + pH 11 ) + (pG + qG )(qH 1 + qH 11 ) + 2
− H 1 2 H 11 +
(qH 1 +qH 11 ) (qH 1 +qH 11 )2
2
− 2

It gives the required upper bound for the difference d.

2. M AIN R ESULTS

(a) The Connected graph :

An amalgamation of fan graphs with K2 (see fig.1) denoted by Aml(Fn , c, m, K2 ) is a con-
nected graph with Vertex set V (Aml(Fn , c, m, K2 )) = {c, xij , yj : 1 ≤ i ≤ n, 1 ≤ j ≤ m} and
Edge set E(Aml(Fn , c, m, K2 )) = {cxij : 1 ≤ i ≤ n, 1 ≤ j ≤ m} ∪
© ª
xij x(i+1)j : 1 ≤ i ≤ n − 1, 1 ≤ j ≤ m ∪ {cyj , 1 ≤ j ≤ m}
Since we establish a super (a, d)-(H 1 , H 11 )-antimagic total labeling for H11 = Fn , isomorphic
to H 1 and H111 = K2 isomorphic to H 11 , thus pG = |V (Aml(Fn , c, m, K2 ))| = mn + m + 1,
qG = |E(Aml(Fn , c, m, K2 ))| = 2mn, pH11 = |V (Fn )| = n + 1, qH11 = |E(Fn )| = 2n − 1,
1 11
pH111 = |V (K2 )| = 2, qH111 = |E(K2 )| = 1, t = |H1j | = |H1j | = m, s = 1
 5

Figure 1: The Amalgamation Aml(Fn , c, m, K2 ) graph, n = 4, c = 1, m = 5 = t, s = 1

If amalgamation of fan graph with K2 Aml(Fn , c, m, K2 ) has a super (a,d)-(Fn , K2 )-antimagic

total labeling then from above parameters it follows from lemma the upper bound of d ≤
5n2 + 3n + 2

Now we discuss the result of the super (a,d)-(Fn , K2 )-antimagic total labeling of amalgama-
tion of fan and singalton edge with the following theorem.
Theorem 2.1. For m, n ≥ 2, the graph Aml(Fn , c, m, K2 ) admits a super ((3m + 32 )n2 +
13
(2m + 2
)n + m + 10, 3n2 − 2n + 3) − (Fn , K2 )-antimagic total labeling.
Proof . Let G = Aml(Fn , c, m, K2 ) define the vertex labeling f as follows:
f (c) = 1
f (xij ) = (j − 1)n + i − 1 1 ≤ i ≤ n, 1 ≤ j ≤ m
f (yj ) = mn + 1 + j 1≤j≤m
and the edge labeling as follows
f (cxij ) = m(n + 1) + 1 + (j − 1)n + i 1 ≤ i ≤ n, 1 ≤ j ≤ m
f (xi x(i+1) ) = m(2n + 1) + 1 + i + (j − 1)(n − 1) 1 ≤ i ≤ n, 1 ≤ j ≤ m
f (cyj ) = (m + 3)(n + 2) + 1 + j 1≤j≤m
6 MALLIKARJUN GHALEPPA AND DANAPPA G AKKA

The vertex and edge labeling f are a bijective fuction f : V (G)∪E(G) → {1, 2, ..., 2(m + 1)(n + 1)} .
The (H 1 , H 11 )-weights of Aml(Fn , c, m, K2 ) for 1 ≤ i ≤ n, 1 ≤ j ≤ m under the labeling f,
constitute the following sets
S Pn
wf = m j=1 [f (c) + i=1 f (xij ) + f (yj )]
Sm
= j=1 [1 + (j − 21 )n2 + 3n 2
+ mn + j + 1]
Sm
= j=1 [(j − 12 )n2 + (m + 23 )n + j + 2]
and the total (H 1 , H 11 )-weights of Aml(Fn , c, m, K2 ) constitute the following sets
S © Pn Pn ª
Wf = m j=1 wf + i=1 f (cxij ) + f (cyj ) + i=1 f (xij , x(i+1)j )
S © ª
= m 2 3 2 17
j=1 3mn + 2mn + (3j − 2 )n − (2j − 2 )n + m + 3j + 7

It is easy to understand that the set

Wf = [(3m + 23 )n2 + (2m + 13
2
)n + m + 10, (3m + 92 )n2 + (2m + 92 )n + m + 13,
15
(3m + 2
)n2 + (2m + 52 )n + m + 16, ..., (6m − 32 )n2 + 17n
2
+ 4m + 7]
It completes the proof.
Theorem 2.2. For m, n ≥ 2, the graph Aml(Fn , c, m, K2 ) admits a super (( 7m
2
+1)n2 +( 5m
2
+
6)n + m + 10, n2 + mn + n − m + 2) − (Fn , K2 )-antimagic total labeling.
Proof . For G = Aml(Fn , c, m, K2 ) define the vertex labeling f as follows:
f (c) = mn + 1
f (xij ) = m(i − 1) + j 1 ≤ i ≤ n, 1 ≤ j ≤ m
f (yj ) = mn + 1 + j 1≤j≤m
and the edge labeling as follows:
f (cxij ) = m(n + 1) + 1 + n(j − 1) + i 1 ≤ i ≤ n, 1 ≤ j ≤ m
f (cyj ) = (m + 3) + (n + 2) + 1 + j 1≤j≤m
f (xij , x(i+1)j ) = m(2n + 1) + 1 + i + m(j − 1) 1 ≤ i ≤ n, 1 ≤ j ≤ m
The vertex and edge labelings f are a bijective function f : V (G)∪E(G) → {1, 2, ..., 2(m + 1)(n + 1)} .
The (H 1 , H 11 )-weights of Aml(Fn , c, m, K2 ) for 1 ≤ i ≤ n, 1 ≤ j ≤ m under the labeling f
constitute the following sets
S Pn
wf = m j=1 [f (c) + i=1 f (xij ) + f (yj )]
Sm mn2 3m
= j=1 [ 2 + ( 2 + j)n + j + 2]
and the total (H 1 , H 11 )-weights of Aml(Fn , c, m, K2 ) constitute the following sets
S © Pn Pn ª
Wf = m j=1 wf + i=1 f (cxij ) + f (cyj ) + i=1 f (xij , x(i+1)j)
 7
Sm © 7m 2 3
ª
= j=1 ( 2 + j)n + (j + 2 )mn + 5n + (n − m + 2)j + 2m + 8

It is easy to understand that the set

Wf = [( 7m
2
+ 1)n2 + ( 5m
2
+ 6)n + m + 10, ( 7m
2
+ 2)n2 + ( 7m
2
+ 7)n + 7n + 12 ,
( 7m
2
+ 3)n2 + ( 9m
2
+ 8)n − m + 14, ..., 92 mn2 + 52 mn + (n − 1)m2 + 5n + 4m + 8]
It completes the proof.
Theorem 2.3. For m ≥ 2, n ≥ 3, the graph Aml(Fn , c, m, K2 ) admits a super [(3m + 32 )n2 +
(6m + 52 )n − 3m + 14, 3n2 − 8n + 11] − (Fn , K2 )-antimagic total labeling.
Proof . For G = Aml(Fn , c, m, K2 ) define the vertex labeling f as follows:
f (c) = mn + 1
f (xij ) = (j − 1)(n − 1) + i 1 ≤ i ≤ n, 1 ≤ j ≤ m
f (xnj ) = m(n − 1) + j 1≤j≤m
f (yj ) = mn + 1 + j 1≤j≤m
and the edge labeling as follows:
f (cxij ) = m(n + 1) + 1 + (j − 1)(n − 1) + i 1 ≤ i ≤ n, 1 ≤ j ≤ m
f (cxnj ) = m(n + 1) + 1 + (n − 1)m + j 1≤j≤m
f (cyj ) = (m + 3)(n + 2) + 1 + j 1≤j≤m
f (xij , x(i+1)j ) = m(2n + 1) + 1 + i + (n − 2)(j − 1) 1 ≤ i ≤ n, 1 ≤ j ≤ m
f (x(n−1)j , xnj ) = m(2n + 1) + 1 + m(n − 2) + j 1≤j≤m
The vertex and edge labelings f are a bijective function f : V (G)∪E(G) → {1, 2, ..., 2(m + 1)(n + 1)} .
The (H 1 , H 11 )-weights of Aml(Fn , c, m, K2 ) for 1 ≤ i ≤ n, 1 ≤ j ≤ m under the labeling f
constitute the following set
S Pn−1
Wf = m j=1 [f (c) + i=1 f (xij ) + f (xnj ) + f (yj )]
Sm
= j=1 [(j − 21 )n2 + (3m − 2j + 32 )n − m + 3j + 1]
and total (H 1 , H 11 )-weights of Aml(Fn , c, m, K2 ) constitute the following sets
S Pn
Wf = m j=1 [wf + i=1 f (cxij ) + f (cxnj ) + f (cyj ) + f (xij , x(i+1)j ) + f (x(n−1) , xnj )]
Sm
= j=1 [(3j + 3m − 32 )n2 + (6m − 8j + 21 2
)n − 3m + 11j + 3]
It is easy to understand that the set
Wf = [(3m+ 32 )n2 +(6m+ 52 )n−3m+14, (3m+ 92 )n2 +(6m− 11
2
)n−3m+25, (3m+ 15
2
)n2 +
27
(6m − 2
)n − 3m + 36, ..., (6m − 32 )n2 − (2m − 21
2
)n + 8m + 3]
8 MALLIKARJUN GHALEPPA AND DANAPPA G AKKA

It completes the proof.

(b) The Disconnected Graph

The disjoint union of amalgamation of fan graphs, denoted by sAml(Fn , c, m, K2 ) is discon-

© ª
nected graph with set V (sAml(Fn , c, m, K2 ) = ck , xkij , yjk , 1 ≤ i ≤ n, 1 ≤ j ≤ m, 1 ≤ k ≤ s
© ª
and E[sAml(Fn , c, m, K2 )] = ck xkij , 1 ≤ i ≤ n, 1 ≤ j ≤ m, 1 ≤ k ≤ s ∪
n o © ª
xkij xk(i+1)j , 1 ≤ i ≤ n − 1, 1 ≤ j ≤ m, 1 ≤ k ≤ s ∪ ck yjk , 1 ≤ j ≤ m, 1 ≤ k ≤ s .

Since we study a super (a,d)-(H 1 , H 11 )-antimagic total labeling for H11 = Fn , isomorphic to
H 1 and for H111 = K2 isomorphic to H 11 , thus pG = |V (sAml(Fn , c, m, K2 )| = s(mn+m+1),
qG = |E[sAml(Fn , c, m, K2 )]| = 2smn, pH11 = |V (Fn )| = n + 1(n), qH11 = |E(Fn )| =
1 11
2n − 1, pH111 = |V (K2 )| = 1(2), qH111 = |E(K2 )| = 1(2), t = |H1j | = |H1j | = sm.

If amalgamation of fan graphs sAml(Fn , c, m, K2 ) has a super (a,d)-(Fn , K2 )-antimagic to-

tal labeling then for pG = s(mn + m + 1), qG = 2smn, pH11 = n + 1(n), qH11 = 2n −
1, pH111 = 1(2), qH111 = 1, t = sm. it follows that from lemma the upper bound of d ≤
(s−1)(n+2) (s−1)(n+2)
5n2 + 3n + 2 + sm−1
. Since 0 ≤ sm−1
≤ 1, it follows that d ≤ 5n2 + 3n + 3.
Theorem 2.4. For m ≥ 2, n ≥ 4, and odd s ≥ 3, the graph sAml(Fn , c, m, K2 ) admits a
super ((4ms + 12 )n2 + (2ms + 3s + 52 )n + 3m + s − ms + 2, n2 + 2n + 2) − (Fn , K2 )-antimagic
total labeling.
Proof . For G = sAml(Fn , c, m, K2 ) define the vertex labeling f for 1 ≤ i ≤ n, 1 ≤ j ≤
m, 1 ≤ k ≤ s as follows:
f (ck ) = k, f (xkij ) = s + i + (j − 1)ns + (k − 1)n, f (yjk ) = nms + js + k and the edge labeling
as follows: for 1 ≤ i ≤ n, 1 ≤ j ≤ m, 1 ≤ k ≤ s.
f (ck xkij ) = (n + 1)ms + (i − 1)ms + js + k
f (ck yjk ) = 2nms + 3n + js + k
k
f (xkij , y(i+1)j ) = 2nms + (i + 1)ms + js + k
The vertex and edge labeling f are a bijective fuction f : V (G)∪E(G) → {1, 2, ..., 2s(m + 1)(n + 1)} .
The (H 1 , H 11 )-weights of sAml(Fn , c, m, K2 ) for 1 ≤ i ≤ n, 1 ≤ j ≤ m, 1 ≤ k ≤ s under the
S Ss n k Pn Pm o
labeling f, constitute the following sets. wf = m j=1 k=1 f (c ) + i=1 f (x k
ij ) + j=1 f (y k
j )
Sm Ss © 1 2 1
ª 1 11
= j=1 k=1 ((j − 1)s + k − 2 )n + (ms + s + 2 )n + js + 2k and the total (H , H )-
weights of sAml(Fn , c, m, K2 ) constitute the following sets
 9
S Ss
Wf = m j=1
1 2 1
k=1 [((j − 1)s + k − 2 )n + (ms + s + 2 )n + 2k+
P P
f (ck xkij ) + f (ck yjk ) + ni=1 f (xkij , xk(i+1)j )]
S Ss © ª
= m j=1
1 2 1
k=1 (4ms + (j − 1)s + k − 2 )n + (2ms + 2js + s + 2k + 2 )n − ms + js + 3m + 2k

It is easy to see that the set

Wf = [(4ms + 12 )n2 + (2ms + 3s + 52 )n − ms + s + 3m + 2, (4ms + 32 )n2 +
(2ms + 3s + 29 )n − ms + s + 3m + 4, ..., (5ms − 12 )n2 + (4ms + 3s + 21 )n + 3m + 2s]
It gives the desired proof.
Theorem 2.5. For m ≥ 2, n ≥ 4, and odd s ≥ 3, the graph sAml(Fn , c, m, K2 ) admits a
2
super ( 9n 2ms + ( 5ms
2
+ 2s + 3)n + 3m + s − ms + 2, 3n + 2) − (Fn , K2 )-antimagic total labeling.
Proof . For G = sAml(Fn , c, m, K2 ) define the vertex labeling f for 1 ≤ i ≤ n, 1 ≤ j ≤
m, 1 ≤ k ≤ s as follows:
f (ck ) = nms + k
f (xkij ) = (i − 1)ms + (j − 1)s + k , f (yjk ) = nms + js + k
and the edge labeling as follows for 1 ≤ i ≤ n, 1 ≤ j ≤ m, 1 ≤ k ≤ s
f (ck xkij ) = (n + 1)ms + (i − 1)ms + js + k,
f (ck yjk ) = 2nms + 3m + js + k,
F (xkij xk(i+1)j ) = 2nms + (i + 1)ms + js + k,
The vertex and edge labeling f are a bijective function f : V (G)∪E(G) → {1, 2, ..., 2s(m + 1)(n + 1)} .
The (H 1 , H 11 )-weights of sAml(Fn , c, m, K2 ) for 1 ≤ i ≤ n, 1 ≤ j ≤ m, 1 ≤ k ≤ s under the
labeling f, constitute the following sets
S Ss © k P ª
wf = m f (c ) + ni=1 f (xkij ) + f (yjk )
S Ss n n2 o
j=1 k=1

= m j=1 k=1 2
ms + 3
2
nms + (j − 1)ns + nk + js + 2k
and the total (H 1 , H 11 )-weights of sAml(Fn , c, m, K2 ) constitute the following sets
S Ss Pn Pn
Wf = m j=1
k
k=1 [f (c ) +
k k
i=1 f (xij ) + f (yj ) +
k k k
i=1 f (c xij ) + f (c yj )+
Pn−1 k k
i=1 f (xij x(i+1)j )]
S Ss
= m j=1
2 3
k=1 [n ms + 2 nms + (j − 1)ns + nk + js + 2k + 4n ms + nms−
2

ms + 2jns + 2nk + 3m]

S Ss © 9 2 ª
= mj=1
5
k=1 2 n ms + ( 2 ms + (j − 1)s + 2js + 3k)n + 3m + js − ms + 2k

It is easy to observe that the set

Wf = [ 29 n2 ms + ( 52 ms + 2s + 3)n + 3m + s − ms + 2, 92 n2 ms + ( 25 ms + 2s + 6)n
10 MALLIKARJUN GHALEPPA AND DANAPPA G AKKA

+3m + s − ms + 4, ..., 29 n2 ms + ( 52 ms + 8s + 9)n + 3m + 3s − ms + 6]

This gives the desired proof.
Theorem 2.6. For m ≥ 2, n ≥ 4, s ≥ 3 and s is an odd integer, the graph sAml(Fn , c, m, K2 )
admits a super (ms(4n2 +4n−2)+s(2n+1)n+ n(n+3)
2
+3(m+1), d2 +4)−(Fn , K2 )-antimagic
total labeling.
Proof . For G = sAml(Fn , c, m, K2 ) define the vertex labeling f for 1 ≤ i ≤ n, 1 ≤ j ≤
m, 1 ≤ k ≤ s as follows:
f (ck ) = nms + k , f (xkij ) = (n − 1)[(k − 1) + (j − 1)s] + i, f (xknj ) = (n − 1)ms + (j − 1)s + k,
f (yjk ) = nms + js + k
and the edge labeling as follows for 1 ≤ i ≤ n, 1 ≤ j ≤ m, 1 ≤ k ≤ s
f (ck xkij ) = (n + 1)ms + (i − 1)ms + js + k
f (ck yjk ) = 2mns + 3m + js + k
f (xkij xk(i+1)j ) = 2nms + (i + 1)ms + js + k
The vertex and edge labeling f are a bijective function f : V (G)∪E(G) → {1, 2, ..., 2s(m + 1)(n + 1)} .
The (H 1 , H 11 )-weights of sAml(Fn , c, m, K2 ) for 1 ≤ i ≤ n, 1 ≤ j ≤ m, 1 ≤ k ≤ s under the
labeling f, constitute the following sets
S Ss © k Pn−1 ª
wf = m j=1 k=1 f (c ) +
k k k
i=1 f (xij ) + f (xnj ) + f (yj )
S Ss
= m j=1
2
k=1 [nms + k + (n − 1) [(k − 1) + (j − 1)s] +
n(n−1)
2
+
(n − 1)ms + (j − 1)s + k + nms + js + k]
and the total (H 1 , H 11 )-weights of sAml(Fn , c, m, K2 ) constitute the following sets
S Ss
Wf = m j=1
2
k=1 [ms(3n−1)+s {(n − 1) (j − 1) + 2j − 1}+(n−1) (k −1)+
2 n(n−1)
2
+3k+
Pn−1 k k k k
P n−1 k k
i=1 f (c xij ) + f (c yj ) + i=1 (xij x(i+1)j )]
S Ss
= m j=1
2 2
k=1 [ms(4n + 4n − 2) + s {n (j − 1) + 3j + 2(n − 1)} +
n(n−1)
(n − 1)2 (k − 1) + 2
+ (2n + 3)k + 3m]
It is observe that the set
n(n+3)
Wf = [ms(4n2 + 4n − 2) + s(2n + 1) + 2
+ 3(m + 1), ms(4n2 + 4n − 2) + s(2n + 1)+
3n
2
(n + 1) + 3m + 7, ..., ms(4n2 + 4n − 2) + s {(n2 + 3)m + 2(n + 1)} + 21 (n − 1)(2 − n) + 3m]
This is required proof.
 11

R EFERENCES

[1] Baca M., Baskoro, Miller M., Rayan J., Simanjuntak R. and Sugeng K. A., Survey of edge-antimagic labellings
of graphs, J. Indonesian Math. Soc. 12 (2006) 113-130.
[2] Baca M. and Barrientos C., On super edge-antimagic total labelings of mKn , Discrete Math., 308 (2008)
5032-5037.
[3] Baca M., and Miller M., Edge antimagic graphs, A wealth of problems and some solutions, Brown Walker
Press, Boca Raton (2008).
[4] Baca M., Kimakova Z., Semanicova-Fenovcikova A., Umar M.A., Tree-antimagicness of disconnected graph,
Math Probl Engin (2015) Article ID 504251; 1-4.
[5] Baca M., Lascsakova M., Miller M., Ryan J. Semanicova-Fenovcikova A., Wheels are cycle-antimagic, Elec-
tronic Notes, Discrete Math. 48(2015)11-18.
[6] Baca M., Millar M., Ryan J. Semanicova-Fenovcikova, On H-antimagicness of disconnected graphs, Bull
Aust. Math. Soc 93 (2)(2016) 1-7.
[7] Baca M., Semanicova-fenovcikova, Umar M.A. and Welyyanti D, On H-antimagicness of Cartesian product
of graphs (submitted).
[8] Enomoto H., Llado A.S., Nakamigawa T., Ringel G., Super edge magic graphs, SVTJ. Math. 34 (1998) 105-
109.
[9] Gutierrez A., Llado A., Magic covering., J. Combin. Math. Combin. Comput. 55 (2005) 43-56.
[10] Inayah N., Salman A.M.N., Simanjuntak R., On (a,d)-H-antimagic coverings of graphs., J. Combin. Math.
Combin. comput. 71 (2009) 273-281.
[11] Inayah N., Simanjuntak R., Salman A.N.M., Super (a,d)-H-intimagic total labellings for Shackles of a con-
nected graph H, Australasian J of Combinatorics Vol. 57 (2013) 127-138.
[12] Jeyanthi P., Muthuraja N.T., Semanicova-Fenovcikova and Dharshikha S.J., More classes of Super cycle
antimagic graphs, Australasian J of Combin, Vol 67 (1) (2017) 46-64.
[13] Jeyanthi P. and selvagopal P., Supermagic coverings of some simple graphs, Int. J. Math, Combin, 7 (2011)
33-48.
[14] Jeyanthi P. and Selvagopal P., More classes of H-super magic graphs, Internal J. Algor Comput Math. 3
(2010) 93-108.
[15] Kotzig A. and Rosa A. Magic valuations of finite graphs, Canada Math. Bull 13 (1970) 451-461.
[16] Llado A., Moragas J., Cycle-magic graphs, Discrete Math. 307(2007) 2925-2933.
[17] Maryati T.K., Salman A.N.M., Baskoro E.T., Super magic coverings of the disjoint union of graphs and
amalgamations, discrete math, 313 (2013) 397-405.
12 MALLIKARJUN GHALEPPA AND DANAPPA G AKKA

[18] Maryati T.K., Salman A.N.M., Baskoro E.T., Ryan J., Millar M. On H-supermagic labelings for certain
Shackles and amalgamations of a connected graph, Utilitas Math. 83 (2010) 333-342.
[19] Muthuraja N.T., Selvagopal P. and Jeyanthi P., Cycle-supermagic coverings and decomposition of some
graphs, Amer J. Math. Sci appl. 2 (1) (2014) 83-92.
[20] Ngurah A.A.G., Salman A.N.M. and Susilowati L., H-supermagic labelings of graphs, Discrete Math. 310
(2010) 1293-1300.
[21] Ngurah A.A.G., Baskoro E.T. and Simanjuntak R., On (a,d)-edge and antimagic total labelings of, m Cn , Bull
Inst. Combin. Applic 48 (2006) 35-44.
[22] Salman A.N.M., Ngurah A.A.G., Izzati, N., On (super)-edge magic total labelings of subdivision of stars Sn
Utilitas Math. 81 (2010) 275-284.
[23] Simanjuntak R., Miller M. and Bertault F., Two new (a,d)-antimagic graph labelings, Proc. 11th Australas
Workshop of Combin Alg (AWOCA) (2000) 179-189.