0% found this document useful (0 votes)
88 views9 pages

Discrete Mathematics: T.K. Maryati, A.N.M. Salman, E.T. Baskoro

Dfjx
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
88 views9 pages

Discrete Mathematics: T.K. Maryati, A.N.M. Salman, E.T. Baskoro

Dfjx
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

Discrete Mathematics 313 (2013) 397–405

Contents lists available at SciVerse ScienceDirect

Discrete Mathematics
journal homepage: www.elsevier.com/locate/disc

Supermagic coverings of the disjoint union of graphs and amalgamations


T.K. Maryati a,b,∗ , A.N.M. Salman b , E.T. Baskoro b
a
Mathematics Education Department, Faculty of Tarbiyah and Teachers Training, Syarif Hidayatullah State Islamic University (UIN) Jakarta, Jl. Ir. H. Djuanda 95,
Ciputat 15412, Indonesia
b
Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Jl. Ganesa 10 Bandung 40132, Indonesia

article info abstract


Article history: Let H be a graph. A graph G = (V , E ) admits an H-covering if every edge in E belongs to a
Received 26 April 2011 subgraph of G isomorphic to H. A graph G is called H-magic if there is a fixed integer k and
Received in revised form 3 November 2012 E → {1, 2, . . . 
a total labeling f : V ∪  , |V | + |E |} such that for each subgraph H ′ = (V ′ , E ′ )
Accepted 5 November 2012
of G isomorphic to H, v∈V ′ f (v) + e∈E ′ f (e) = k. If f (V ) = {1, 2, . . . , |V |}, then G is
H-supermagic. In this paper, we investigate the G-supermagicness of a disjoint union of c
copies of a graph G. We characterize all such graphs of being G-supermagic. We also show
Keywords:
H-covering
that a disjoint union of any paths is cPh -supermagic for some c and h. Besides, we prove
H-magic labeling that certain subgraph-amalgamation of graphs G is G-supermagic.
H-supermagic labeling © 2012 Elsevier B.V. All rights reserved.
(k, Θ )-balanced

1. Introduction

The H-(super)magic labelings were first studied by Gutiérrez and Lladó in 2005 [5]. These labelings are the generalization
of the edge-magic and super edge-magic labelings that were introduced by Kotzig and Rosa [7] and Enomoto et al. [3],
respectively. For further information about (super) edge-magic labelings, one can see [1,2,4,16,18]. In [5], Gutiérrez and
Lladó considered star-(super)magic and path-(super)magic labelings of some connected graphs. In [9], Maryati, Baskoro and
Salman gave Ph -(super)magic labelings of some trees such as shrubs, subdivision of shrubs and banana tree graphs. Lladó
and Moragas [8] studied the cycle-(super)magic behavior of several classes of connected graphs. They gave several families
of Cr -magic graphs for every r ≥ 3. Some other results on Cn -supermagic labelings of several classes of graphs can be found
in [13,14,17].
The H-(super)magic labelings were first studied by Gutiérrez and Lladó in 2005 [5]. These labelings are the generalization
of the edge-magic and super edge-magic labelings that were introduced by Kotzig and Rosa [7] and Enomoto et al. [3],
respectively. For further information about (super) edge-magic labelings, one can see [1,2,4,16,18]. In [5], Gutiérrez and
Lladó considered star-(super)magic and path-(super)magic labelings of some connected graphs. In [9], Maryati, Baskoro and
Salman gave Ph -(super)magic labelings of some trees such as shrubs, subdivision of shrubs and banana tree graphs. Lladó
and Moragas [8] studied the cycle-(super)magic behavior of several classes of connected graphs. They gave several families
of Cr -magic graphs for every r ≥ 3. Some other results on Cn -supermagic labelings of several classes of graphs can be found
in [13,14,17].
This paper is organized as follows. In Section 2, we define the concept of a (k, Θ )-balanced multiset as a generalization
of a k-balanced multiset [12]. This result is used to prove our main results throughout this paper. In Section 3, we study
G-supermagic labelings of the disjoint union of c isomorphic copies of G, denoted by cG, where G is a graph where every

∗ Corresponding author at: Mathematics Education Department, Faculty of Tarbiyah and Teachers Training, Syarif Hidayatullah State Islamic University
(UIN) Jakarta, Jl. Ir. H. Djuanda 95, Ciputat 15412, Indonesia.
E-mail addresses: [email protected] (T.K. Maryati), [email protected] (A.N.M. Salman), [email protected] (E.T. Baskoro).

0012-365X/$ – see front matter © 2012 Elsevier B.V. All rights reserved.
doi:10.1016/j.disc.2012.11.005
398 T.K. Maryati et al. / Discrete Mathematics 313 (2013) 397–405

its component has at least 2 vertices. We give a necessary and sufficient condition for such graph to be G-supermagic.
k
Additionally, we show that disjoint union of paths, denoted by i=1 Pni , is cPh -supermagic for some c and h. In the last
section, we show that certain subgraph-amalgamations of a graph G are G-supermagic. In this  paper, we consider finite
graphs. We use the notation [a, b] where a and b are integers to mean {x ∈ N|a ≤ x ≤ b} and

X to mean x∈X x. We
define {a} ⊎ {a, b} = {a, a, b}. A set X is said to be a 2-set if |X | = 2.

2. (k , Θ )-balanced multiset

In [12] we have given a definition of a k-balanced multiset. Now, we give a definition of a (k, Θ )-balanced multiset as
the generalization of a k-balanced multiset.
Let k ∈ N and k ≡ 0(mod Θ ). A multiset Y that contains some positive integers is said to be (k, Θ )-balanced if there
exist k submultisets of Y , namely Y1 , Y2 , . . . , Yk and there exist Θ different values, namely a1 , a2 , . . . , aΘ such that i=1 Yi =
k

Y , |Yi | =
|Y |
for every i ∈ [1, k] and Yt −1+ k = as for t ∈ {1, k
+ 1, 2k + 1, . . . , k(ΘΘ−1) + 1}
  
k
Yt = Yt +1 = · · · = Θ Θ
Θ
and s = (t − 1) Θk + 1. For every i ∈ [1, k], Yi is called a balanced submultiset of Y . For Θ = 1, a (k, Θ )-balanced multiset is
a k-balanced multiset.

Lemma 1. Let x, y, z and k be non-negative integers and Y = [x + 1, x + k] ⊎ [y + 1, y + k] ⊎ [z + 1, z + k] be a multiset. Then


(1) for even k ≥ 2, Y is (k, 2)-balanced,
(2) for odd k ≥ 3, Y is k-balanced.

Proof. (1) Let k ≥ 2 be an even integer. For every i ∈ [1, k], define a multiset Yi = {ai , bi , ci } where

ai = x + i ;
 
k k

y + + i

 for i ∈ 1, ;
2 2
bi =  
k k
+ 1, k ;

y − + i
 for i ∈
2 2
 
k

z + k + 2 − 2i

 for i ∈ 1, ;
2
ci =  
k
+ 1, k .

z + 2k + 1 − 2i
 for i ∈
2
It is easy to check that

A = {ai |1 ≤ i ≤ k} = [x + 1, x + k];
B = {bi |1 ≤ i ≤ k} = [y + 1, y + k];
C = {ci |1 ≤ i ≤ k} = [z + 1, z + k].

Yi = Y . For every i ∈ [1, k], we obtain |Yi | = 3 and


k
Since A ⊎ B ⊎ C = Y , we have i=1
 
3k k

x + y + z +

 +2 for i ∈ 1, ;
 2 2
Yi =  
3k k
+ 1, k .

x + y + z +
 +1 for i ∈
2 2
Therefore, Y is (k, 2)-balanced.
(2) Let k ≥ 3 be an odd integer. For every i ∈ [1, k], define a multiset Yi = {ai , bi , ci } where

ai = x + i ;
    
k k


y + +i for i ∈ 1, ;
2 2

bi =     
k k
,k ;

y −
 +i for i ∈
2 2
  
k

z + k + 1 − 2i

 for i ∈ 1, ;
2
ci =     
k k
,k .

z + k + 2
 − 2i for i ∈
2 2
T.K. Maryati et al. / Discrete Mathematics 313 (2013) 397–405 399

Let
A = {ai |1 ≤ i ≤ k} = [x + 1, x + k];
B = {bi |1 ≤ i ≤ k} = [y + 1, y + k];
C = {ci |1 ≤ i ≤ k} = [z + 1, z + k].

It can be checked that A ⊎ B ⊎ C = Y . So i=1 Yi = Y . Furthermore, for every i ∈ [1, k], we obtain |Yi | = 3 and
k

Yi = x + y + z + k + ⌈ 2k ⌉ + 1. Therefore, Y is k-balanced. 

Lemma 2. Let x, y, z and k be non-negative integers. For even k ≥ 2, the multiset Y = [x, x + k] \ { 2k + x} ⊎ [y + 1, y + k] ⊎
[z + 1, z + k] is k-balanced.
Proof. For every i ∈ [1, k], define a multiset Yi = {ai , bi , ci } where
 
k

x + i − 1

 for i ∈ 1, ;
2
ai =  
k
+ 1, k ;

x + i
 for i ∈
2

k k

y + + i

 for i ∈ 1, ;
2 2
bi =  
k k
+ 1, k ;

y − + i for i ∈

2 2
 
k

z + k + 2 − 2i

 for i ∈ 1, ;
2
ci =  
k
+ 1, k .

z + 2k + 1 − 2i for i ∈

2
Let
   
k k
A = {ai |1 ≤ i ≤ k} = x, +x−1 ∪ + x + 1, x + k ;
2 2
B = {bi |1 ≤ i ≤ k} = [y + 1, y + k];
C = {ci |1 ≤ i ≤ k} = [z + 1, z + k].

Yi = Y . For every i ∈ [1, k], we obtain |Yi | = 3 and


k  3k
Since A ⊎ B ⊎ C = Y , we have i=1 Yi = x + y + z + 2
+ 1.
Therefore, Y is k-balanced. 

Lemma 3. Let x, y and k be integers such that 1 ≤ x < y and k > 1. If X = [x, y] and |X | is a multiple of 2k, then X is
k-balanced.
Proof. For every i ∈ [1, k], define Xi = {aij |1 ≤ j ≤
|X |
k
} where

x − 1 + (j − 1)k + i

for odd j;
aij =
x + jk − i for even j.

It is easy to check that for every i ∈ [1, k] satisfies |Xi | = , (x + y). Therefore, X is
|X | k  |X |
k i =1 Xi = X and Xi = 2k
k-balanced. 

3. G-supermagic coverings of the disjoint union of graphs

In this section, we consider supermagic coverings of two classes of any graphs, namely a disjoint union of c copies of G,
k
denoted by cG, and a disjoint union of paths, denoted by i=1 Pni .
Maryati et al. [10] proved the following result. Let c be a positive integer and G be a non-trivial connected graph. Then
cG is G-supermagic if and only if |V (G)| + |E (G)| is even or c is odd. Now, we generalize the result for any graph which is
not necessarily connected and simple. The result is a characterization of cG being a G-supermagic as we state it in the next
theorem.

Theorem 1. Let c be a positive integer and G be a graph with all its components have at least 2 vertices.
(i) If cG is G-magic, then |V (G)| + |E (G)| is even or c is odd;
(ii) If |V (G)| + |E (G)| is even or c is odd, then cG is G-supermagic.
400 T.K. Maryati et al. / Discrete Mathematics 313 (2013) 397–405

Proof. Let G1 , G2 , . . . , Gβ be the components of G, |V (G)| = n and |E (G)| = m.


(i) Let cG be a G-magic graph and let f be a G-magic labeling of cG. Then,
 
f (G) = f (V (G)) + f (E (G))
c (n + m)(c (n + m) + 1)
=
2c
(n + m)(c (n + m) + 1)
= .
2
Since f (G) is an integer, n + m is even or c is odd.
(ii) If n + m is even or c is odd, then order all Gi s such that ni + mi is odd for every i ∈ [1, α] and ni + mi is even for every
j
i ∈ [α + 1, β], where ni = |V (Gi )| and mi = |E (Gi )|. For all i ∈ [1, β] and j ∈ [1, c ], let Gi be components of cG
j j
isomorphic to Gi such that Gi1 ̸= Gi2 if j1 ̸= j2 . Let
Z = [1, c (n + m)];
Y = [1, 2c α] ∪ [cn + 1, c (n + α)];
X = [2c α + 1, cn] ∪ [c (n + α) + 1, c (2n − α)];
W = [c (2n − α) + 1, c (n + m)].

Depending upon the values of n, m, α and c , Z is partitioned into subsets in the following ways.
1. For α = 0 and n = m, define X = Z .
2. For α = 0 and n < m, partition Z into two sets X and W .
3. For 1 ≤ α < m and n < m + α , partition Z into three sets Y , X and W .
4. For 1 ≤ α < m and n = m + α , partition Z into two sets Y and X .
5. For 1 ≤ α < m and n = 2α , partition Z into two sets Y and W .
6. For α = m and n = 2α , define Y = Z .
If there exists X , then partition X into 2-sets, namely Xa for a ∈ [1, c (n − 2α)] such that

Xa = c (2n + α) + 1, for each a.

It is evident that α is even if n + m is even and α is odd if n + m is odd. Hence, if W exists then it can be partitioned into
2-sets Wb for b ∈ [1, 2c (m − n + α)] such that

Wb = c (3n + m − α) + 1, for each b.

Next, we divide the proof into two cases.


Case 1. n + m is even.
Then α is even. We divide the case into three subcases.
Subcase 1. α = 0.
Define a total labeling f on cG as follows.
• Use the elements of Xa for all a ∈ [1, cn] to label all pairs of the vertices and edges of cG such that the elements of Xa are
used to label a pair of a vertex and an edge in the same component of cG. Use the smallest labels for the vertices.
• If n < m, then use the elements of Wb for all b ∈ [1, 2c (m − n)] to label pairs of the remaining edges in the same
component of cG.
We obtain that for every i ∈ [1, β] and j ∈ [1, c ],

j 1
f (Gi ) = ni (2cn + 1) + (mi − ni )(3cn + cm + 1).
2
For the following subcases, let k = c α, x = 0, y = c α and z = cn. By using Lemma 1(1), we obtain that Y is (k, 2)-
balanced. For every s ∈ [1, k], let Ys be a balanced submultiset of Y as defined in the proof of Lemma 1(1). Since Y is a set, Ys
is a set.
Subcase 2. 2 ≤ α ≤ m.
Define a total labeling f on cG as follows.

• For each i ∈ [1, α2 ] and each j ∈ [1, c ], label two vertices and an edge of Gji by using the elements of Ys for some s ∈ [1, 2k ].
Assign the smallest labels to the vertices.
• For each i ∈ [ α2 + 1, α] and each j ∈ [1, c ], label two vertices and an edge of Gji by using the elements of Ys for some
s ∈ [ 2k + 1, k]. Assign the smallest labels to the vertices.
T.K. Maryati et al. / Discrete Mathematics 313 (2013) 397–405 401

• If n ≤ m + α and α ̸= m, then use the elements of Xa for all a ∈ [1, c (n − 2α)] to label all remaining pairs of the vertices
and edges of cG such that the elements of Xa are used to label a pair of a vertex and an edge in the same component of
cG. Use the smallest labels for the vertices.
• If n = 2α or n < m + α and α ̸= m, then use the elements of Wb for all b ∈ [1, 2c (m − n + α)] to label pairs of the
remaining edges in the same component of cG.
Since α = m, it follows that α = β . We obtain that for every j ∈ [1, c ],
5c α β
  
cn +

 +2 for i ∈ 1, ,
j 2 2
f (Gi ) =
5c α β
 
+ 1, β .

cn +
 +1 for i ∈
2 2
For 2 ≤ α < m, we obtain that for every j ∈ [1, c ],
 5c α 1  α
cn + + 2 + (n i − 2)( 2cn + c α + 1) + ( mi − n i + 1)( 3cn + cm − c α + 1 ) for i ∈ 1, ,
2 2 2



5c α α

j 1
f (Gi ) = cn +
 
+ 1 + (ni − 2)(2cn + c α + 1) + (mi − ni + 1)(3cn + cm − c α + 1) for i ∈ + 1, α ,

 2 2 2
n (2cn + c α + 1) + 1 (m − n )(3cn + cm − c α + 1) for i ∈ [α + 1, β].


i i i
2
Furthermore, for even α ≥ 0 and every subgraph G′ of cG isomorphic to G, we obtain that
5α 3α
 
1
f (G′ ) = c α n+ + + (n − 2α)(2cn + c α + 1) + (m − n + α)(3cn + cm − c α + 1).
2 2 2
Since both n + m and α are even, f (G′ ) is an integer. Hence, f is a G-supermagic labeling of cG.
Case 2. Both n + m and c are odd.
We obtain that 1 ≤ α ≤ m and α is odd. Let k = c α, x = 0, y = c α and z = cn. By using Lemma 1(2), we obtain that Y
is k-balanced. For every s ∈ [1, k], let Ys be a balanced submultiset of Y as defined in the proof of Lemma 1(2). Since Y is a
set, Ys is a set.
Define a total labeling f on cG as follows.

• For each i ∈ [1, α] and each j ∈ [1, c ], label two vertices and an edge of Gji by using the elements of Ys for some s ∈ [1, k].
Assign the smallest labels to the vertices.
• If n ≤ m + α and α ̸= m, then use the elements of Xa for all a ∈ [1, c (n − 2α)] to label all remaining pairs of the vertices
and edges of cG such that the elements of Xa are used to label a pair of a vertex and an edge in the same component of
cG. Assign the smallest labels to the vertices.
• If n = 2α or n < m + α and α ̸= m, then use the elements of Wb for all b ∈ [1, 2c (m − n + α)] to label pairs of the
remaining edges in the same component of cG.
Since α = m, it follows that α = β . We obtain that for every i ∈ [1, β] and j ∈ [1, c ],
 cα 
j
f (Gi ) = 2c α + cn + + 1.
2
For 1 ≤ α < m, we obtain that for every j ∈ [1, c ],
  cα  1
2c α + cn + 2 + 1 + (ni − 2)(2cn + c α + 1) + 2 (mi − ni + 1)(3cn + cm − c α + 1)


for i ∈ [1, α];
j
f (Gi ) =
n (2cn + c α + 1) + 1 (m − n )(3cn + cm − c α + 1) for i ∈ [α + 1, β].


i i i
2
Furthermore, every subgraph G′ of cG isomorphic to G satisfies
  cα   1
f (G′ ) = α 2c α + cn + + 1 + (n − 2α)(2cn + c α + 1) + (m − n + α)(3cn + cm − c α + 1).
2 2
Since all n + m, α , and c are odd, f (G ) is an integer. Hence, f is a G-supermagic labeling of cG. The proof is complete.



In Fig. 1, we provide a G-supermagic labeling of 4G as defined in the proof of Theorem 1 where G ∼ = K 4 ∪ K 1 ,4 ∪ K 2 ,3 ∪ C 3 .


Next, we consider cPh -supermagic labeling of i=1 Pni for some c and h. We define the path Pni for i ∈ [1, k] as a graph
k
with V (Pni ) = {v1i , v2i , . . . , vni i } and E (Pni ) = {v1i v2i , v2i v3i , . . . , vni i −1 vni i }.
In [11], Maryati et al. proved that kP5 is cP3 -supermagic for odd k ≥ 1 and c ∈ [1, k]. Now we give a result as we state in
the following theorem.
402 T.K. Maryati et al. / Discrete Mathematics 313 (2013) 397–405

Fig. 1. A G-supermagic labeling of 4G where G ∼


= K4 ∪ K1,4 ∪ K2,3 ∪ C3 .

Theorem 2. Let k ≥ 1 be an odd integer. For all i ∈ [1, k], let ni be the integers such that ⌈ ⌉ < n1 ≤ n2 ≤ · · · ≤ nk . If
nk
2
c ∈ [1, k] and h ∈ [⌈ ⌉ + 1, n1 ], then
nk k
2 i=1 Pni is cPh -supermagic.

Pni . Let Z = [1, 2n − k] where n =


k k
Proof. Let k ≥ 1 be an odd integer. Let G ∼
= i =1 i=1 ni . Partition Z into two sets Y
and X as follows.

Y = [1, 2k] ∪ [n + 1, n + k];


X = [2k + 1, n] ∪ [n + k + 1, 2n − k].
T.K. Maryati et al. / Discrete Mathematics 313 (2013) 397–405 403

Fig. 2. P8 ∪ P8 ∪ P9 ∪ P9 ∪ P10 is cPh -supermagic for c ∈ [1, 5] and h ∈ [6, 8].

Let x = 0, y = k and z = n. By using Lemma 1(2), we obtain that Y is k-balanced, as k is odd. For every i ∈ [1, k], let Yi be a
balanced submultiset of Y as we defined in the proof of Lemma 1(2). We check that for each i ∈ [1, k],
 
 k
Yi = 2k + n + + 1 = Ȳ.
2
Since Y is a set, Yi is a set.
Partition X into 2-sets, namely X1 , X2 , . . . , X2n−4k , such that for each a ∈ [1, 2n − 4k],

Xa = 2n + k + 1 = X̄.

Define a total labeling f of G as follows.


• For i ∈ [1, k], let ti = ⌊ n2i ⌋. Use the elements of Yi to label vtii , vtii +1 , and vtii vtii +1 of Pni . Assign the smallest labels to the
vertices.
• Use the elements of Xa for all a ∈ [1, 2n − 4k] to label all remaining pairs of the vertices and edges of G such that the
elements of Xa are used to label a pair of a vertex and an edge in the same component of G. Assign the smallest labels to
the vertices.
We obtain that for c ∈ [1, k] and h ∈ [⌈ ⌉ + 1, n1 ],
nk
2

f (cPh ) = c (Ȳ + (h − 2)X̄)


   
k
= c n(2h − 3) + h(k + 1) + −1 .
2
k
Hence, f is a cPh -supermagic labeling of i =1 Pni . 
For example, we present a cPh -supermagic labeling of P8 ∪ P8 ∪ P9 ∪ P9 ∪ P10 for c ∈ [1, 5] and h ∈ [6, 8] as in Fig. 2.

4. G-supermagic coverings of certain subgraph-amalgamations

In this section, we consider G-supermagic labelings of certain subgraph-amalgamations of G. We define a subgraph-


amalgamation of G as follows. Let {Gi }ki=1 be a finite collection of graphs and each Gi contains a subgraph H called a terminal
subgraph. The H-amalgamation, denoted by Amal{Gi , H , k}, is a graph formed by taking all the Gi ’s and identifying their
terminal subgraphs. In the case when an H-amalgamation is constructed from k copies of a connected graph G, we denote
such graph by Amal(G, H , k).
In [12] Maryati et al. proved that Amal(G, {v}, k), where {v} is a fixed vertex of G, is G-supermagic. Jeyanthi and
Selvagopal [6] proved that an edge amalgamation of a finite collection of graphs isomorphic to a 2-connected simple graph
G is G-supermagic. Salman and Maryati [15] proved that Amal(G, Pn , k) is also G-supermagic. In this section, we give a
sufficient condition Amal(G, H , k) for any subgraph H of G being G-supermagic.
404 T.K. Maryati et al. / Discrete Mathematics 313 (2013) 397–405

Theorem 3. Let k ≥ 2, G be a non-trivial connected graph and H be a subgraph of G with |V (G) ∪ E (G)| − |V (H ) ∪ E (H )| ≥ 2.
If Amal(G, H , k) contains exactly k subgraphs isomorphic to G, then Amal(G, H , k) is G-supermagic.
Proof. Let G be a connected graph with |V (G)| = n and |E (G)| = m and let H be a subgraph of G with |V (H )| = p and
|E (H )| = q. It is clear that for k ≥ 2, Amal(G, H , k) has k(n − p) + p vertices and k(m − q) + q edges. Let Z = [1, ks + p + q],
where s = (n + m) − (p + q) and s ≥ 2. Now we consider the following two cases.
Case 1. s is odd.
We divide the case into two subcases depending on the value of k.
Subcase 1. k is odd.
Partition Z into two sets in the following ways.

{k + 1}, if p = 1;
W =
[k + 1, k + p] ∪ [ks + p + 1, ks + p + q], if p ≥ 2.
Y = [1, k] ∪ [k(s − 2) + p + 1, ks + p].
Let x = 0, y = k(s − 2) + p and z = k(s − 1) + p. By using Lemma 1(2), we obtain that Y is a k-balanced multiset. For
each i ∈ [1, k], let Yi be a balanced submultiset of Y defined as in the proof of Lemma 1(2). Since Y is a set, Yi is a set.
Subcase 2. k is even.
Partition Z into two sets in the following ways.
 
k

 + 1 , if p = 1;
2

W =  
k
+ 1 ∪ [k + 2, k + p] ∪ [ks + p + 1, ks + p + q], if p ≥ 2.



2
 
k
Y = [1, k + 1] \ + 1 ∪ [k(s − 2) + p + 1, ks + p].
2
Let x = 1, y = k(s − 2) + p and z = k(s − 1) + p. By Lemma 2, Y is k-balanced. For each i ∈ [1, k], let Yi be a balanced
submultiset of Y defined as in the proof of Lemma 2. Since Y is a set, Yi is a set.
Furthermore, for any k ≥ 2 and s > 3, let X = [k + p + 1, k(s − 2) + p]. We have |X | = k(s − 3) is even and k = s − 3
|X |

is also even. By Lemma 3, X is k-balanced. For every i ∈ [1, k], let Xi be a balanced subset of X as defined in the proof of
Lemma 3.
Define a total labeling f of Amal(G, H , k) as follows.
• Use the elements of W to label the vertices and edges of the terminal subgraph H. Assign the smallest labels to the
vertices.
• Use the elements of Yi ∪ Xi to label all the remaining vertices and edges of Gi for every i ∈ [1, k]. Assign the smallest
labels to the vertices.
For every i ∈ [1, k], we obtain that |V (Gi ) ∪ E (Gi )| = |W | + |Yi | + |Xi | and
  
f (Gi ) = W+ Yi + Xi
  
1 k 1
 (p + q)(p + q + 1) + k(p + sq + 2s − 1) + 2p + + (s − 3)(ks − k + 2p + 1), if k is odd;


2 2 2
=
1 1
 (p + q)(p + q + 1) + k(p + sq + 2s − 2) + 2p + 2 + (s − 3)(ks − k + 2p + 1),

if k is even.
2 2
We get f (Gi ) is an integer since s is odd. Hence, f is a G-supermagic labeling of Amal(G, H , k).
Case 2. s is even.
Partition Z into two sets W and X as follows.

{1}, if p = 1;
W =
[1, p] ∪ [ks + p + 1, ks + p + q], if p ≥ 2.
X = [p + 1, ks + p].
By Lemma 3, we obtain that X is k-balanced. For each i ∈ [1, k], let Xi be a balanced subset of X defined as in the proof of
Lemma 3.
Next, we define a total labeling f of Amal(G, H , k) as follows.
• Use the elements of W to label the vertices and edges of the terminal subgraph H. Assign the smallest labels to the
vertices.
• For every i ∈ [1, k], use the elements of Xi to label all the remaining vertices and edges of Gi . Assign the smallest labels
to the vertices.
T.K. Maryati et al. / Discrete Mathematics 313 (2013) 397–405 405

Fig. 3. A W4 -supermagic labeling of Amal(W4 , C4 , 4).

It is easy to check that for every i ∈ [1, k], |V (Gi ) ∪ E (Gi )| = |W | + |Xi | and
 
f (Gi ) = W+ Xi
1 s
= (p + q)(p + q + 1) + ksq + (ks + 2p + 1)
2 2
is an integer. Hence, f is a G-supermagic labeling of Amal(G, H , k). The proof is complete. 

In Fig. 3, we show W4 -supermagic labelings of Amal(W4 , C4 , 4).

References

[1] M. Bača, J. MacDougall, M. Miller, Slamin, W. Wallis, Survey of certain valuations of graphs, Discussiones Mathematicae Graph Theory 20 (2000)
219–229.
[2] M. Bača, M. Miller, Super Edge-Antimagic Graphs, BrownWalker Press, Boca Raton, Florida, USA, 2008.
[3] H. Enomoto, A. Lladó, T. Nakamigawa, G. Ringel, Super edge magic graphs, SUT Journal of Mathematics 34 (1998) 105–109.
[4] J.A. Gallian, A dynamic survey of graph labeling, Electronic Journal of Combinatorics 17 (2010) #DS6.
[5] A. Gutiérrez, A. Lladó, Magic coverings, Journal of Combinatorial Mathematics and Combinatorial Computing 55 (2005) 43–56.
[6] P. Jeyanthi, P. Selvagopal, Supermagic coverings of some simple graphs, International Journal of Mathematical Combinatorics 1 (2011) 33–48.
[7] A. Kotzig, A. Rosa, Magic valuations of finite graphs, Canadian Mathematical Bulletin 13 (4) (1970) 451–461.
[8] A. Lladó, J. Moragas, Cycle-magic graphs, Discrete Mathematics 307 (23) (2007) 2925–2933.
[9] T.K. Maryati, E.T. Baskoro, A.N.M. Salman, Ph -(super)magic labelings of some trees, Journal of Combinatorial Mathematics and Combinatorial
Computing 65 (2008) 197–204.
[10] T.K. Maryati, A.N.M. Salman, E.T. Baskoro, Irawati, The supermagicness of a disjoint union of isomorphic connected graphs, in: The Proceedings of the
4th IMT-GT International Conference on Mathematics, Statistics and its Applications, vol. 3, 2008, pp. 1–5.
[11] T.K. Maryati, A.N.M. Salman, E.T. Baskoro, Irawati, On Ph -supermagic labelings of cPn , in: The Proceedings of the 14th National Conference of
Mathematics, 2009, pp. 281–285.
[12] T.K. Maryati, A.N.M. Salman, E.T. Baskoro, J. Ryan, M. Miller, On H-supermagic labelings for certain shackles and amalgamations of a connected graph,
Utilitas Mathematica 83 (2010) 333–342.
[13] A.A.G. Ngurah, A.N.M. Salman, I.W. Sudarsana, On supermagic coverings of fans and ladders, SUT Journal of Mathematics 46 (1) (2010) 67–78.
[14] A.A.G. Ngurah, A.N.M. Salman, L. Susilowati, H-supermagic labelings of graphs, Discrete Mathematics 310 (8) (2010) 1293–1300.
[15] A.N.M. Salman, T.K. Maryati, On graph-(super)magic labelings of a path-amalgamation of isomorphic graphs, in: The Proceedings of the 6th IMT-GT
International Conference on Mathematics, Statistics and its Applications, 2010, pp. 228–233.
[16] A.N.M. Salman, A.A.G. Ngurah, N. Izzati, On (super) edge-magic total labellings of a subdivision of a star Sn , Utilitas Mathematica 81 (2010) 275–284.
[17] A.N.M. Salman, A.D. Purnomo, Some cycle-(super)magic labelings of some complete bipartite graphs, East-West Journal of Mathematics (2010)
283–291.
[18] W.D. Wallis, Magic Graphs, Biskhäuser, Boston, Basel, Berlin, 2001.

You might also like