A simple graph G (V, E) admits an H- magic covering if every edge E belongs to subgraph of G isomorphic to H and there exists a bijection function λ: V (G) ∪ E(G) → {1,2,…,|V(G)|} + |E(G)|} such that for all subgraph H′ = (V′, E′) isomorphic to H and satisfying , where m(f) is constant magic sum. A graph G is an H- supermagic labeling if λ(V) = {1,2,…,|V(G)|} and s(f) is a constant supermagic sum. This work aim is to study C4 − supermagic covering of grid graph and C3 − supermagic covering of .
REFERENCES
1.
2.
3.
A.
Kotzig
and A.
Rosa
, Canad. Math. Bull.
13
, 451
(1970
).4.
5.
A.
Llado
and J.
Moragas
, Discrete Math.
307
, 2925
(2007
).6.
T. K.
Maryati
, E. T.
Baskoro
, and A. N. M
Salman
, J. Combin. Math. Combin. Comput.
65
, 197
(2008
).7.
A. A. G.
Ngurah
, A. N. M.
Salman
, and L.
Susilowati
, Discrete Math.
310
, 1293
(2010
).8.
M.
Roswitha
and E. T.
Baskoro
, AIP Conference Proceeding
1450
, 135
(2012
).9.
T. K.
Maryati
, A. N. M
Salman
, E. T.
Baskoro
, J.
Ryan
and M.
Miller
, Utilitas Mathematica
83
, 333
(2010
).10.
11.
G.
Chartrand
and and L.
Lesniak
, Graphs and Digraphs
, 3rd edition (Chapman and Hall
, London
, 1996
).
This content is only available via PDF.
© 2018 Author(s).
2018
Author(s)