Martin BACA, Andrea SEMANICOVA-FENOVCIKOV, Muhammad Awais UMAR, Des WELYYANTI

OnH-antimagicness of Cartesian product of graphs

A graphG= (V(G);E(G)) admits anH-covering if every edge inEbelongs to a subgraph ofGisomorphic toH. A graphGadmitting anH-covering is called (a;d)-H-antimagicif there is a bijectionf:V(G)[E(G)!f1;2;:::;jV(G)j+jE(G)jgsuch that, for all subgraphsH′ofGisomorphic toH, theH-weights,wtf(H′) =∑v2V(H′)f(v)+∑e2E(H′)f(e);constitute an arithmetic progression with the initial termaand the commondifferenced. In this paper we provide some sufficient conditions for the Cartesian product of graphs to beH-antimagic.We use partitions subsets of integers for describing desiredH-antimagic labelings.

PDF

___

[1]Acharya BD,Hegde SM. Strongly indexable graphs. Discrete Math 1991; 93: 123-129.
[2]Baca M, Brankovic L, Semanicova-Fenovckova A. Labelings of plane graphs containing Hamilton path. Acta MathSinica - English Series 2011; 27: 701-714.
[3]Baca M, Kimakova Z, Semanicova-Fenovckova A, Umar MA. Tree-antimagicness of disconnected graphs. MathProbl Engin 2015; Article ID 504251: 1-4.
[4]Baca M, Kovar P, Semanicova-Fenovckova A, Sha q MK. On super (a;1)-edge-antimagic total labelings of regulargraphs. Discrete Math 2010; 310: 1408-1412.
[5]Baca M, Lascsakova M, Miller M, Ryan J, Semanicova-Fenovckova A. Wheels are cycle-antimagic. Electronic NotesDiscrete Math 2015; 48: 11-18.
[6]Baca M, Miller M. Super Edge-antimagic Graphs: A Wealth of Problems and Some Solutions. Boca Raton, FL,USA: Brown Walker Press, 2008.
[7]Baca M, Miller M, Phanalasy O, Semanicova-Fenovckova A. Superd-antimagic labelings of disconnected planegraphs. Acta Math Sinica - English Series 2010; 26: 2283-2294.
[8]Baca M, Miller M, Ryan J, Semanicova-Fenovckova A. OnH-antimagicness of disconnected graphs. Bull AustMath Soc 2016; 93: 1-7.
[9]BezegovaL, Ivanco J. On conservative and supermagic graphs. Discrete Math 2011; 311: 2428-2436.
[10]Enomoto H, Llado AS, Nakamigawa T, Ringel G. Super edge-magic graphs. SUT J Math 1998; 34: 105-109.
[11]Figueroa-Centeno RM, Ichishima R, Muntaner-Batle FA. The place of super edge-magic labelings among otherclasses of labelings. Discrete Math 2001; 231: 153-168.
[12]Gutierrez A, Llado A. Magic coverings. J Combin Math Combin Comput 2005; 55: 43-56.
[13]Ichishima R, Lopez SC, Muntaner-Batle FA, Rius-Font M. The power of digraph products applied to labelings.Discrete Math 2012; 312: 221-228.
[14]Inayah N, Llado A, Moragas J. Magic and antimagicH-decompositions. Discrete Math 2012; 312: 1367-1371.
[15]Inayah N, Salman ANM, Simanjuntak R. On (a;d)-H-antimagic coverings of graphs. J Combin Math CombinComput 2009; 71: 273-281.
[16]Inayah N, Simanjuntak R, Salman ANM, Syuhada KIA. On (a;d)-H-antimagic total labelings for shackles ofa connected graphH. Australasian J Combin 2013; 57: 127-138.
[17]Jeyanthi P, Selvagopal P. More classes ofH-supermagic graphs. Internat J Algor Comput Math 2010; 3: 93-108.
[18]Kotzig A, Rosa A. Magic valuations of nite graphs. Canad Math Bull 1970; 13: 451-461.
[19]Lih KW. On magic and consecutive labelings of plane graphs. Utilitas Math 1983; 24: 165-197.
[20]Llado AS, Moragas J. Cycle-magic graphs. Discrete Math 2007; 307: 2925-2933.
[21]Marr AM, Wallis WD. Magic Graphs. New York, NY, USA: Birkhauser 2013.
[22]Maryati TK, Baskoro ET, Salman ANM.Ph-(super)magic labelings of some trees. J Combin Math Combin Comput2008; 65: 198-204.
[23]Maryati TK, Salman ANM, Baskoro ET. Supermagic coverings of the disjoint union of graphs and amalgamations.Discrete Math 2013; 313: 397-405.
[24]Maryati TK, Salman ANM, Baskoro ET, Ryan J, Miller M. OnH-supermagic labelings for certain shackles andamalgamations of a connected graph. Utilitas Math 2010; 83: 333-342.
[25]Ngurah AAG, Salman ANM, Susilowati L.H-supermagic labelings of graphs. Discrete Math 2010; 310: 1293-1300.
[26]Salman ANM, Ngurah AAG, Izzati N. On (super)-edge-magic total labelings of subdivision of starsSn. UtilitasMath 2010; 81: 275-284.348

ISSN: 1300-0098
Yayın Aralığı: Yılda 6 Sayı
Yayıncı: TÜBİTAK

Arşiv