International Journal of Advanced Engineering Research and Science (IJAERS) [Vol-4, Issue-5, May- 2017]

https://dx.doi.org/10.22161/ijaers.4.5.32 ISSN: 2349-6495(P) | 2456-1908(O)

Super complete-antimagicness of Amalgamation

of any Graph
R.M Prihandini1,3, Ika Hesti Agustin1,4, Dafik1,2, Ridho Alfarisi1,3
1
CGANT-University of Jember, Jember, Indonesia
2
Department of Mathematics Education, University of Jember, Jember, Indonesia
3
Department of Elementary School Teacher Education, University of Jember, Jember, Indonesia
4
Department of Mathematics, University of Jember, Jember, Indonesia

AbstractLet be a finite collection of simple, nontrivial only covered a connected version of shackle of graph when
and undirected graphs and let each have a fixed vertex a vertex as a connector, and their paper did not cover all
called a terminal. The amalgamation as as a feasible . Our paper attempt to solve a super (, )
terminal is formed by taking all the 's and identifying antimagic total labeling of = (, , ) and its
their terminal. When are all isomorphic graphs, for any disjoint union when is a complete graph for feasible .
positif integer we denote such amalgamation by = To show those existence, we will use a special technique,
(, , ), where denotes the number of copies of namely an integer set partition technique. We consider the

. The graph is said to be an (, ) -antimagic total partition , (, ) of the set {1, 2, , } into columns
graph if there exist a bijective function : () () with 2, -rows such that the difference between the
{1, 2, , | ()| + |()|} such that for all subgraphs sum of the numbers in the ( + 1)th -rows and the sum
isomorphic to , the total weights () = of the numbers in the th -rows is always equal to the
() () + () () form an arithmetic constant ,where = 1, 2, , 1. The
,
sequence {, + , + 2, . . . , + ( 1)}, where partition, (, , ) of the set {1, 2, , }into
and are positive integers and is the number of all columns with , 2, -rows such that the difference
subgraphs isomorphic to . An (, ) -antimagic total between the sum of the numbers in the ( + 1)th -rows
labeling is called super if the smallest labels appear in and the sum of the numbers in the th -rows is always
the vertices. In this paper, we study a super (, ) equal to the constant for = 1, 2, , , where =
antimagic total labeling of = (, , ) and its 1, 2, , 1. Thus these sums form an arithmetic
disjoint union. sequence with the difference . We need to establish some
,
KeywordsSuper -antimagic total graph, lemmas related to the partition , (, )and , (, , ).
Amalgamation of graph, arithmetic sequence. These lemmas are useful to develop the super (, )
antimagic total labeling of = (, , )and =
I. INTRODUCTION (, , ).
A graph is said to be an (, ) -antimagic total graph
if there exist a bijective function : () () II. SOME USEFUL LEMMAS
{1,2, , | ()| + |()|} such that for all subgraphs of Let G be an amalgamation of any graph H, denoted by =
isomorphic to , the total -weights () = (, , ). The graph is a connected graph with
() () + () () form an arithmetic sequence |()| = , |()| = , |()| = , and ()| =
{, + , + 2, . . . , + ( 1)}, where and are . The vertex set and edge set of the graph =
positive integers and is the number of all subgraphs of (, , ) can be split into following sets: () =
isomorphic to. If such a function exist then is called {} { ; 1 1 , 1 } and () =
an(, ) -antimagic total labeling of . An(, ) { ; 1 , 1 }. Let , be positive
-antimagic total labeling is called super if : () integers with 2 and 3. Thus |()| = =
{1, 2, , | ()|}. ( 1) + 1and |()| = = .
There many articles have been published in many journals, Furthermore, let be a disjoint union of amalgamation of
some ofthem can be cited in [2, 3, 7, 8] and [9, 10, 11, 12, graph , denoted by = (, , ) and bean odd
13]. For connected graph, Inayah et al. in [7] proved that, positive integer. The graph G is a disconnected graph with
for is a non-trivial connected graph and 2 is an |()| = , |()| = , |()| = , and |()| =
integer, (, , ) which contains exactly . The vertex set and edge set of the graph =
subgraphs isomorphic to is -super antimagic. They

www.ijaers.com Page | 202

International Journal of Advanced Engineering Research and Science (IJAERS) [Vol-4, Issue-5, May- 2017]
https://dx.doi.org/10.22161/ijaers.4.5.32 ISSN: 2349-6495(P) | 2456-1908(O)

(, , ) can be split into following sets:() = {, () = { (2 + + 1) 2 , (2 + +
2} 2 2

{ ; 1 } {{ } ; 1 1, 1 1) 2 , ,2
(2 + + 1) }. Itis easy to see 2
2

, 1 } and () = {{ } ; 1 , 1 that the differences of those sequences are 1 =
,1 }. Let , , and odd be positive , 2 = 2 . It concludes the proof.
integerswith 2 and , 3. Thus |()| = = Lemma 3.2
(( 1) + 1)and |()| = = . Let and be positive integers. For 1 , the sum
The upper bound of feasible for = (, , ) and of
= (, , ) to be a super (, ) antimagic + ( 1); 1 ;
{,3}
(, ) = {
total labeling follows the following lemma [2]. ( 2) + 2; 1 ;
1
Lemma 2.1 [2] form an aritmatic sequence of difference 3 = 2 + .
2
Let be a simple graph of order and size . If is super Proof.
(, ) antimagic total labeling then By simple calculation, it gives
=1 {,3 } (, ) =
{({} {} ){} +({} {} ){} }
, for {} = |()|, {} = 2
1 {,3}
() {,3}
() = {( + ) + ( 2
2 4
|()|, {} = |()|, {} = |()|,and = | |. 2
)} {,3}
() = {( + ) + ( 2
Corollary 2.1 2 4
2
For 2, if the graph = (, , ) admits super ), (2 + 2) + ( 2 ), , ( + ) +
4 2
(, ) -antimagic total labeling then 2 + 2
( 2 )}. It concludes the proof.
4

Lemma 3.3
Corollary 2.2
Let and be positive integers. For 1 , the sum
For 2 and odd 3, if the disconnected graph =
of
(, , ) admits super (, ) -antimagic total
+ ; 1 ;
labeling then 2 + 2 +
{(1)_} {,4}
(, ) = {
1 + 2 2; 1 ;
1
We recall a partition {,} (, ) introduced in [4]. We will form an aritmatic sequence of difference 4 = ( 2 +
2
use the partition for a linear combination in developing a
).
bijection of vertex and edge label of the main theorem.
Lemma 2.2[4] Proof.


Let and be positive integers. The sum of {,} (, ) = By simple calculation, it gives
=1 {,4 } (, ) =

{( 1) + , 1 } and {,} (, ) = {( {,4}
() {,4}
() = { (3 + + 2 + 4)
4
1) + ; 1 } form an aritmatic sequence of 2
( + )} {,4}
() = { (3 + + 2 + 4)
difference {, 2 }, respectively. 2 4
2
III. THE RESULTS ) , ( (3 + + 2 + 4) 2
2 4
The Connected Graph 32
2) , , (3 + + 2 + 4) 3)}.We have
The following four lemmas are useful for the existence of 4 2

super (, ) antimagic total labeling = the desired difference.

(, , ). Now we are ready to present the main theorem related to
Lemma 3.1 the existence of super (, ) antimagicness of the
Let and be positive integers. For 1 , the sum connected graph = (, , ), in the following

of {, (, ) = {1 + ; 1 } and theorem.
1}
Theorem 3.1
{, 2}
(, ) = { + ; 1 } form an
For 2, the graph = (, , ) admits a super
arithmetic sequence of differences 1 = , 2 =
(, ) antimagic total labeling with feasible =
2 . 1 1
Proof. 1 2 + 32 42 + 52 + 5 ( 62 + 6 ) +
2 2
1 1 2
By simple calculation, for = 1,2, . . . , , it gives 1 2 + 32 42 + ( 52 + 5 ) ( 6 + 6 )
2 2

2
=1 {,1 } (, ) = {,1 } () {,1 } () = { ( + Proof.
2
2
) + }} {,1}
^() = { ( + Let and be positive integers, with = 1and =
2

), ( + ) , ( + ) 2, , (2 +
2 2 . For = 1,2, , and = 1,2, , , by Lemma 2.2,
2 2 2

3.1, 3.2 and 3.3 we define the vertex and the edge labels as
) } =1 {,2}
() {,2}
()
a linear combination of {1 ,1 }
(, );

{,2}
() = {{ (2 + + 1)} 2 }
{2 ,2 } (, );{2 ,2 } (, );{ ,2} (, );
2
3 3

www.ijaers.com Page | 203

International Journal of Advanced Engineering Research and Science (IJAERS) [Vol-4, Issue-5, May- 2017]
https://dx.doi.org/10.22161/ijaers.4.5.32 ISSN: 2349-6495(P) | 2456-1908(O)

{ 2 (, ); 1 (, );
4 ,4 } {5 , 52 +5 }
2

{ 1 2 (, ) as follows:
6 ,(26 +6 )}
10 34 11
_1() = 1, and

1 ({,} ) = {{1 ,1 }
1} {{ 2 ,2 }
[(1 ) + 1]}

{{ 2 [(1 + 2 ) + 1]}
3 ,3 } 20 21

{{ 2 [(1 + 2 + 3 ) + 1]} 142
4 ,4 }

4
2 6
{{ 1 [ {=1} + 1]} 9 3
2
5 , 5 +5 }
2 17 33 19 18 24 12
5
{{ 1 2 [ {=1} + 1]} 1 22
6 ,( 6 +6 )}
211 31 165 35
2
37 30 23

1 ({,} ) = {{1 ,1 }
[ + 1]} 16 32 27 26 25 13
5 7
{{2 ,2 }
[(1 ) + + 1]} 8 4
188
{{ 2 [(1 + 2 ) + + 1]}
3 ,3 }

{{ 2 [(1 + 2 + 3 ) + + 1]} 28 29
4 ,4 }

4
{{ 1 2 [ {=1} + + 1]} 36
5 ,25 +5 }
5 15 14
{{ 1 2 [ {=1} + + 1]}
6 ,(26 +6 )}
Fig.1: Super (142,23)-H- antimagic total covering of
The vertex labeling is a bijective function: ()
graph G=Amal(C5, v, 4)
() {1,2, , + }. The total edge-weights of =
(, , ) under the labeling , for = 1,2, , ,
The Disjoint Union Graph
constitute the following sets:
The following lemmas are useful for the existence of
{1} = 1 () + 1 ({,} ) + 1 ({,} ) super (, ) antimagic total labeling disjoint union of
the graph , denoted by = (, , ).
1 Lemma 3.5

= {,} + [1 2 + 32 42 + 52 + 5 Let , and be positive integers 1 ; 1
2
1 2 1 {,}
, the sum of {,7} (, , ) = {( 1) + + (
( 6 + 6 ) + 1 2 + 32 42 + ( 52 + 5 )
2 2 1); 1 ; 1 ; 3 } and the sum
It is easy that the set of total edge-weights {1 } consists of {,}
of {,8 } (, , ) = {( 1) + + + ( 1); 1
an arithmetic sequence of the smallest value a and the
1 } form an arithmetic sequence of differences 5 =
difference = 1 2 + 32 42 + 52 + 5
2 2 and 6 = .
1 1
( 62 + 6 ) + 1 2 + 32 42 + ( 52 + 5 ) Proof.
2 2
1
( 62 + 6 ).Since the biggest is attained when = 2 + By simple calculation, for = 1,2, . . . , ,
2 {} {} {}
2 it gives =1 {,5 } (, ) = {,5 } () {,5 } (, ) =
then, for = 1and = , it gives 0
1 {}
2 + 2 0 ( 1)2 + 2 2 + 2 { ( 2 ) + 2 + 2 ( 1)} {,5} (, ) =
2
0 2 + 2 ( 1) 1 1 1
{ ( 2 ) + 2 , ( 2 ) + 22 , , (
2 + 2 . It concludes the proof. 2
1
2
1
2
2
)+ 2 , ( 2)
+ ( + 1)2 , ( 2 ) +
2 2
1
( + 2) , , ( 2 ) + 2 }.
2
Furthermore
2
{,} {,} {,}
=1 {,6} (, ) = {,6} () {,6} (, ) =
{,}
{ (2 ) + (( 1) + )} {,6 } (, ) =
2

{ (2 ) + , (2 ) + 2, , (2
2 2 2

) + , (2 ) + ( + 1), (2 ) + ( +
2 2

2), , (2 ) + }. It concludes the proof.
2

www.ijaers.com Page | 204

International Journal of Advanced Engineering Research and Science (IJAERS) [Vol-4, Issue-5, May- 2017]
https://dx.doi.org/10.22161/ijaers.4.5.32 ISSN: 2349-6495(P) | 2456-1908(O)

2 ({,} )=
Lemma 3.6 ( + 1) + 1 2 + [( 2) + 1],
Let , and be positive integers 1 ; 1 , {1}
{,}
1 , = 1
2
the sum of {,7 } (, , ) = { + + (
( + 2) + 1 2 + [( 2) + 1],
{,} +1
); 1 } and the sum of{,8 } (, , ) = { , = 1
2
( 1) + (); 1 ; 1 ; 3 1
(1 ) + + + + [( 2) + 1],
} form an arithmetic sequences of difference 7 = 2
+1
2 and 8 = . , =
2
1
Proof. (1 3) + + + + [( 2) + 1],
2
By simple calculation, for = 1,2, . . . , , +1
{,} {,} {,} { , =
it gives =1 {,7 } (, ) = {,7 } () {,7 } (, ) = 2
{,}
2 ({,} )= {{1,1} [( + 1)]}
{ (2 + + 1) + 2 2 ( + )}
2 {,}
{,} 2 2
{{2,2 } [((1 ) + + 1)]}
{,7} (, ) = { (2 + + 1) + ( +
2 {,}
{{ 2 [((_1)) + (2 )
1), (2 + + 1) + 2 2 ( + 3 ,3 }
2 ,
+ + 1)]} {{ [((1 )
2), , (2 + + 1) + 2 2 (2), (2 + 4
2
4 }
2 2
+ 1) + 2 2 (2 + 1), , + (2 ) + (3 ) + + 1)]}
The vertex labeling 2 is a bijective function 2 : ()
(2 + + 1) + 2 2 ( + )}. Furthermore
2 () {1,2, , + }. The total edge-weights of
{,} {,} {,}
=1 {,8} (, ) = {,8 } () {,8 } (, ) = = (, , ) under the labeling , for =
1 1,2, , and = 1,2, , , constitute the following sets:
{ (2 + )( + 1) + ( + )}
2

{,} 1
{,8} (, ) = { (2 + )( + 1) + ( + {2} = 2 ( ) + 2 ({,} )1 2
2
1 1
1), (2 + )( + 1) + ( + 2), , (2 + + 2 ({,} )1 + 1 ({,} )
2 2
1
)( + 1) + (2), (2 + )( + 1) + {,}
{2 } = {{,} + [1 2 + 32 42 + 1 2
2
1
(2 + 1), , (2 + )( + 1) + + 32 42 ]}( + )
2
( + )}. It concludes the proof. It is easy that the set of total edge-weights {2 } consists of
Now we are ready to present the main theorem related to an arithmetic sequence of the smallest value and the
the existence of super (, ) antimagicness of the difference = 1 2 + 32 42 + 1 2 + 32
disconnected graph = (, , ), in the following 42 . Since the biggest is attained when = 2 + 2 then,
theorem. for = 3 and = , it gives 0 2 +
Theorem 3.2 (1)
2 + 0 ( 3)2 + 2 2 +
For 2 and odd 3, the graph = (, , ) 1
(1)
admits a super (, ) antimagic total labeling with 2 + It concludes the proof.
1
feasible = 1 2 + 32 42 + 1 2 + 32 42 .
Proof. IV. CONCLUSION
For = 1,2, , and = 1,2, , ,by Lemma 3.5 and 3.6 We have shown the existence of super antimagicness of
we define the vertex and the edge labels as a linear amalgamation of complete graph , denoted by =
combination of (, , ) for connected one and = (, , )
{,} {,} {,}
{1 ,1 } (, , ), {2 ,2 } (, , ), { 2 (, , ), and for disconnected one, where is any graph. By using a
3 ,3 }
{,} partition technique we can prove that (, , )
{ 2 (, , )as follows:
4 ,4 } admits a super (, ) antimagic total labeling with
1 ( ) = , and for = 1,2, , 2 = 1 2 + 32 42 + 52 + 5 ( 62 +
1 1
{,} {,} 2 2
2 ({,} ) = {{1 ,1} } {{2 ,2} (1 + 1)} 1 2 1 2
6 ) + 1 2 + 32 42 + ( 5 + 5 ) ( 6 + 6 ), but
{,} {,} 2 2
{{ 2 ((1 + 2 ) + 1)} {{ 2 for = (, , ), the existence of its super
3 ,3 } 4 ,4 }

((_1 + _2 + _3) + 1)} antimagicness only holds for odd with = 1 2 +

32 42 + 1 2 + 32 42 . We also note that if the
amalgamation of complete graph contains a subgraph as
a connector then finding the labels for feasible remains

www.ijaers.com Page | 205

International Journal of Advanced Engineering Research and Science (IJAERS)
https://dx.doi.org/10.22161/ijaers.4.5.32
widely open. Thus, we propose the following open
problem.
Open Problem
Let be a subgraph of and = (, , ). For
even, does admit a super (, ) antimagic total
labeling for 2 and feasible ?
ACKNOWLEDGEMENTS
We gratefully acknowledge the support from DP2M
research grant HIKOM-DIKTI and CGANT University
of Jember of year 2016.
[Vol-4, Issue-5, May- 2017]
ISSN: 2349-6495(P) | 2456-1908(O)
[12] S.T.R. Rizvi, K. Ali, M. Hussain, Cycle-supermagic
labelings of the disjoint union of graphs, Utilitas
Mathematica, (2014), in press.
[13] Roswitha, M. and Baskoro, E. T., H-magic covering
on some classes of graphs, American Institute of
Physics Conference Proceedings 1450 (2012), 135-
138.
[14] R. Simanjuntak, M. Miller and F. Bertault, Two new
(a; d)-antimagic graph labelings, Proc. Eleventh
Australas. Workshop Combin. Alg. (AWOCA)
(2000), 179189.

REFERENCES
[1] M. Baca, L. Brankovic, M. Lascsakova, O.,
Phanalasy, A. Semanicova-Fenovckova, On d-
antimagic labelingsof plane graphs, Electr. J. Graph
Theory Appli., 1(1), 28-39, (2013)
[2] Dafik, A.K. Purnapraja, R Hidayat, Cycle-Super
Antimagicness of Connected and Disconnected
TensorProduct of Graphs, Procedia Computer
Science, 74, (2015), 9399
[3] Dafik, Slamin, Dushyant Tanna, Andrea
Semanicova-Fenovckova, Martin Baca,
Constructions of Hantimagicgraphs using smaller
edge-antimagic graphs, Ars Combinatoria, 100
(2017), In Press
[4] Dafik, Moh. Hasan, Y.N. Azizah, Ika Hesti Agustin,
A Generalized Shackle of Any Graph H Admits
aSuper H-Antimagic Total Labeling, Mathematics in
Computer Science Journal, (2016). Submitted
[5] J.L. Gross, J. Yellen and P. Zhang, Handbook of
Graph Theory, Second Edition, CRC Press, Taylor
andFrancis Group, 2014
[6] N. Inayah, A.N.M. Salman and R. Simanjuntak, On (a;
d) H-antimagic coverings of graphs, J. Combin.Math.
Combin. Comput. 71 (2009), 273281.
[7] N. Inayah, R. Simanjuntak, A. N. M. Salman, Super
(a; d)-H-antimagic total labelings for shackles of
aconnected graph H, The Australasian Journal of
Combinatorics, 57 (2013), 127138.
[8] P. Jeyanthi, P. Selvagopal, More classes of H-
supermagic Graphs, Intern. J. of Algorithms,
Computing andMathematics 3(1) (2010), 93-108.
[9] A. Llado and J. Moragas, Cycle-magic graphs,
Discrete Math. 307 (2007), 2925 2933.
[10] T.K. Maryati, A. N. M. Salman, E.T. Baskoro, J.
Ryan, M. Miller, On H- supermagic labelings for
certainshackles and amalgamations of a connected
graph, Utilitas Mathematica, 83 (2010), 333-342.
[11] A. A. G. Ngurah, A. N. M. Salman, L. Susilowati, H-
supermagic labeling of graphs, Discrete Math., 310
(2010), 1293-1300.

www.ijaers.com Page | 206