STAR-SUPERMAGIC COVERING

ON GENERALIZED PETERSEN GRAPH AND SUN GRAPH

Ismiyati Marfuah, Mania Roswitha, Sri Kuntari.
Department of Mathematics
Faculty of Mathematics and Natural Sciences
Sebelas Maret University

Abstract. A simple graph G = (V (G), E(G)) admits an H-covering if every edge in

E(G) belongs to asubgraph of G isomorphic to H. G is H-magic if there is a total
labeling : V (G) E(G) {1, 2, . . . , |V (G)| + |E(G)|}, such that for each subgraph
H = (V (G), E (G)) of G isomorphic to H. The property of it that given any subgraph

def
H , then (H ) =
vV f (v) +
eE (e) = m(), where m() is a constant magic
sum. If the label of vertices are {1, 2, ..., |V (G)|}, then s() is a constant supermagic
sum. This research aims to find K1,3 star-supermagic covering on generalized Petersen
graph GPn,k and sun graph Sn . We prove that generalized Petersen graph GPn,k and
sun graph Sn admit star K1,3 -supermagic labeling.
Kata Kunci : star-supermagic covering, generalized Petersen graph, sun graph.

1. Introduction
In graph theory, the notion about graph labeling was first introduced by Rosa
[6] in 1967. A labeling is one to one mapping that carries the vertex set on nonnegative numbers called label. Gallian [2] has shown that there are a lot of benefits
of the labeling research was rapidly developed.
Sedlacek [8] introduced a magic labeling, one type of graph labelings that mostly
had been studied recently. A magic labeling on a graph G is a one to one map
: E(G) {1, 2, 3, . . .} such that the sum of the labels around any vertex equals
some constant. One of magic labelings that frequently discussed is the edge-magic
total labeling. Wallis [?] defined an edge-magic total labeling as a one to one map
: V (G) E(G) {1, 2, ..., |V (G)| + |E(G)|}, with the property that, given any
edge uv (u) + (uv) + (v) = k for some constant magic sum k. An edge-magic
total labeling will be called an edge-supermagic labeling if the vertex labels are
{1, 2, . . . , |V (G)|}. Gallian [2] proved that a generalized Petersen graph GPn,2 where
n 3 and n odd can be covered by edge-supermagic labeling. Later on the edgemagic labeling was developed into a magic covering by Gutierrez dan Llado [3].
A G = (V (G), E(G)) graph admits an H-magic covering if every edge of E(G) bedef
longs to H subgraph of G that isomorphic with H satisfying (H ) = vV (v) +

eE (e) = m(), where m() is a constant magic sum and s() is a constant
supermagic sum of H if (V ) = {1, 2, . . . , |V |}. Maryati et al. [4] have found a
Pn -supermagic covering on banana tree graph and shurb graph. Later on Roswitha
1

Star-supermagic covering on . . .

I. Marfuah, M. Roswitha, S. Kuntari

dan Baskoro [7] proved that there is a Sn,n -supermagic covering on caterpillar graph
Sn1 ,n2 ,...,nk where n1 = n2 = ... = nk = n, and a F2,n -supermagic covering on firecracker graph Fk,n where k integer, n even. Roswitha dan Baskoro [7] also proved
that a Sn+1 -supermagic covering on double star graph Sn,n and a B(k1),n -supermagic
covering on banana tree graph Bk,n where k, n integer. The aims of this research is
to determine a K1,3 -supermagic covering on generalized Petersen graph GPn,k where
n = 5, 7, k = 1, 2 and sun graphs Sn where n = [3, 9] and n odd.
2. Main Results
2.1. A K1,3 -supermagic covering on generalized Petersen graph GPn,k .
Chao [1] defined that a generalized Petersen graph GPn,k was constructed from
V (GPn,k ) that have outer vertices {u1 , u2 , ..., un } and inner vertices {v1 , v2 , ..., vn }.
E(GPn,k ) have outer edges ui ui+1 , inner edges vi vi+k(mod n) , and spokes ui vi where
i = 1, 2, ..., n, n 3, k 1, and n, k integer.
Theorem 2.1. Graf generalized Petersen GPn,k where n = 5, 7 and k = 1, 2 is
K1,3 -supermagic.
Proof. Suppose a graph G is a generalized Petersen graph GPn,k with |V (G)| = 2n
and |E(G)| = 3n. There are 2n possibles of K1,3 -supermagic coverings of it. The
proof is divided into three cases.
(1) A generalized Petersen graph GPn,k where n = 5 and k = 1, 2
(a) Let ui be outer vertices and vi be inner vertices. Then label the vertices are
follows
(ui ) = i,

for i [1, n]

(vi ) = i + n, for i [1, n].

(b) Let ui vi be spokes, ui ui+1 (mod n) be outer edges, and vi vi+k (mod n) be inner
edges. Then the edges are labeled by
(ui vi ) = 5n i + 1, for i [1, n]

4n + i 2, for i [1, n ]
2
(ui ui+1 (mod n) ) =
2n + i + 3, for i [ n , n]
2

2n + i + 3, for k = 1 and i [1, n2 ]

2n + i 2, for k = 1 and i [ n , n]
2
(vi vi+k (mod n) ) =

2n + i + 1, for k = 2 and i [1, n 1]

n + i + 1, for k = 2 and i = n.

(2) A generalized Petersen GPn,k where n = 7 and k = 1

2

2012

Star-supermagic covering on . . .

I. Marfuah, M. Roswitha, S. Kuntari

(a) Let ui be outer vertices and vi be inner vertices. Then label the vertices are
follows

for i [1, n]

(ui ) = i,

(vi ) = i + n, for i [1, n].

(b) Let ui vi be spokes, ui ui+1 (mod n) be outer edges, and vi vi+k (mod n) be inner
edges. Then the edges are labeled by

5n + i 2, for i [1, 3 ]
(ui vi ) =

5n i + 1, for i [ n2 , n 2]

3n + i + 2, for i [n 1, n]

4n i + 1, for i [1, 2 ]
(ui ui+1 (mod n) ) =

4n i,

for i [ n2 , n 1]

3n + 4,
for i = n

3n i + 1, for i [1, 2 ]
(vi vi+k (mod n) ) =

3n i,

for i [ n2 , n 1]

2n + 4,

for i = n.

(3) A generalized Petersen GPn,k where n = 7 and k = 2

(a) Let ui be outer vertices and vi be inner vertices. Then label the vertices are
follows

(ui ) = i,
for

n + i + 3,
(vi ) =
2n i,

n + k + 1,

i [1, n]
for i [1, n2 ]
for

i [ n2 + 1, n 1]

for i = n.
2012

Star-supermagic covering on . . .

I. Marfuah, M. Roswitha, S. Kuntari

(b) Let ui vi be spokes, ui ui+1 (mod n) be outer edges, and vi vi+k (mod n) be inner
edges. Then the edges are labeled by

4n + k + i, for i [1, n 2]
(ui vi ) =
3n + k + i, for i [n 1, n]

4n i + 1, for i [1, n3 ]

3n + i 1, for i = n
2
(ui ui+1 (mod n) ) =
n

2(n + i), for i [ 2 , n 1]

3n + 4, for i = n

3n,
for i = 1

2n i + 4, for i [ n , n ]
3
3
(vi vi+k (mod n) ) =
n

2n + i 1, for i [ 2 , n 2]

4n i k, for i [n 1, n].

Let H be a subgraph K1,3 of GPn,k where n = 5 and k = 1, 2. If the center vertex

of H is vi , then the constant sum in each subgraph H can be found by the formula,
(H) = (vi ) + (ui ) + (vi1 ) + (vi+1 ) + (vi ui ) + (vi1 vi ) + (vi vi+1 ),
and
(H) = 15n + 1.

(2.1)

Let H be a subgraph K1,3 of GPn,k where n = 7 and k = 1, 2. If the center vertex

of H is ui , then we can find the constant sum in each subgraph H as follows
(H) = (vi ) + (ui ) + (ui1 ) + (ui+1 ) + (vi ui ) + (ui1 ui ) + (ui ui+1 ),
and
(H) = 15n.
This completes the proof of the theorem.

(2.2)


Illustration 2.1. An example of graph GPn,k covered by K1,3 -supermagic covering

can be seen in Figure 1.
From Figure 1, it is obvious that if a subgraf H on GP5,1 isomorphic to K1,3 and
the center vertex is u1 = 1 then the constant sum s() = 76.
4

2012

Star-supermagic covering on . . .

I. Marfuah, M. Roswitha, S. Kuntari

1
18

1
19

25

18

21
10

13

14

12
17

21
10

7 24

11
15

12

7 24

15
11

20

13

20

22

23

23
3

16

14

17

22
4

19

25

GP5 ,1

16

GP5 , 2

Figure 1. A K1,3 -supermagic covering on generalized Petersen graph, (a.) GP5,1 dan (b.)
GP5,2 .

2.2. A K1,3 -supermagic covering on sun (Sn ).

Mirzakhah [5] defined a sun graph Sn as a graph obtained from a cycle Cn by adding
a pendant edge to each vertex of the cycle. A sun graph Sn was constructed from
V (Sn ) = {v1 , v2 , . . . , vn , u1 , u2 , . . . , un } and E(Sn ) = {vi vi+1(mod n) , {ui vi }, where
i = 1, 2, . . . , n and n integer.
Theorem 2.2. A sun graph Sn where n = [3, 9] and n odd is K1,3 -supermagic.
Proof. Suppose a graph G is a sun graph Sn with |V (G)| = 2n and |E(G)| = 2n.
There are n possibles K1,3 -supermagic coverings of it. The proof is divided into four
cases.
(1) A sun graph Sn for n = 3
(a) Let ui be outer vertices and vi be inner vertices. Then label the vertices are
follows
(ui ) = 2n i + 1, for i [1, n]
for i [1, n].

(vi ) = i,

(b) Let ui vi be spokes and vi vi+1 (mod n) be inner edges. Then the edges are
labeled by
(ui vi ) = 3n + i, for i [1, n]
(vi vi+1(mod n) ) = 2n + i, for i [1, n].

(2) A sun graph Sn for n = 5

(a) Let ui be outer vertices and vi be inner vertices. Then label the vertices are
follows
(ui ) = 2n i + 1, for i [1, n]
for i [1, n].

(vi ) = i,

2012

Star-supermagic covering on . . .

I. Marfuah, M. Roswitha, S. Kuntari

(b) Let ui vi be spokes and vi vi+1 (mod n) be inner edges. Then the edges are
labeled by

2(n + i) + 4, for i [1, n ]

2
(ui vi ) =
2(n + i) 1, for i [ n + 1, n],
2

3n 2(i 1), for i [1, n ]

2
(vi vi+1(mod n) ) =
2(2n i + 1), for i [ n + 1, n].
2

(3) A sun graph Sn for n = 7

(a) Let ui be outer vertices and vi be inner vertices. Then label the vertices are
follows
(ui ) = 2n i + 1, for i [1, n]
for i [1, n].

(vi ) = i,

(b) Let ui vi be spokes and vi vi+1 (mod n) be inner edges. Then the edges are
labeled by

3n + 2i 1, for i [1, 2 ]
(ui vi ) =
3n + i + 1, for i = n2 + 1

n + 2(2 + i), for i [ n2 + 2, n],

3n + i 2, for i [1, n2 1]

2n + i 1, for i [ n , n ]
2
2
(vi vi+1(mod n) ) =
n

n
+
i
+
3,
for
i
=

+
1

3n i + 4, for i [ n2 + 2, n].

(4) A sun graph Sn for n = 9

(a) Let ui be outer vertices and vi be inner vertices. Then label the vertices are
follows
(ui ) = 2n i + 1, for i [1, n]
for i [1, n].

(vi ) = i,

2012

Star-supermagic covering on . . .

I. Marfuah, M. Roswitha, S. Kuntari

(b) Let ui vi be spokes and vi vi+1 (mod n) be inner edges. Then the edges are
labeled by

(n + i)( n3 ), for i [1, n3 ]

5n 3i + 2, for i [ n , n ]
2
2
(ui vi ) =
n

5n + 4 3i, for i [ 2 + 1, n2 + 2]

5i n 2, for i [n 1, n],

2n + 3(i + 1), for i [1, 3 1]

7i 2,
for i [ n3 , n3 + 1]
(vi vi+1(mod n) ) =
2n

5i 5,
for i [ 2n

3 1, 3 ]

n + i + 5,
for i [ 2n
3 + 1, n].

Let H be a subgraph K1,3 of Sn where n = [3, 9] and n odd. If the center vertex of
H is vi , then the constant sums in each subgraph H can be found by the formula,
(H) = (vi ) + (ui ) + (vi1 ) + (vi+1 ) + (vi ui ) + (vi1 vi ) + (vi vi+1 ),
and
n
(H) = 15 + 23 .
2
This completes the proof of the theorem.

(2.3)


Illustration 2.2. An example of graph Sn covered by K1,3 -supermagic covering can

be seen in Figure 2. From Figure 2, it can be derived that if a subgraf H on S3
10

16
1
6

19
5

2 18

13

14
4

10

15

12

11

17

11

20

9
3

S5

12
5

S3

Figure 2. A K1,3 -supermagic covering on sun graph, (a.) S5 dan (b.) S3 .

isomorphic to K1,3 and the center vertex is v1 = 1 then the constant sum s() = 38.
3. conclusion
The conclusions of this research are the K1,3 -supermagic covering of generalized
Petersen graph GPn,k where n = 5, 7 and k = 1, 2 can be obtained by Theorem 2.1
and sun graph Sn where n = [3, 9] and n odd can be obtained by Theorem 2.2.
7

2012

Star-supermagic covering on . . .

I. Marfuah, M. Roswitha, S. Kuntari

References
1. Chao, C. Y. dan S. Han, On the Toughness of Cycle Permutation Graphs, Czechoslovak Mathematical Journal 51 (2001), no. 126, 239260.
2. Gallian, J. A., Dynamic Survey of Graph Labeling, The Electronic Journal of Combinatoric 18
(2011).
3. Guti
errez, A. and A. Llad
o, Magic Coverings, J. Combin. Math. Combin. Comput 55 (2005),
4346.
4. T. K. Maryati, Karakteristik Grapf H-ajaib dan Graf H-ajaib super, Disertasi, Institut Teknologi
Bandung, 2011.
5. Mirzakhah, M., dan D. Kiani, The Sun Graph is Determiden by Its Signless Laplacian Spectrum,
Electronic Journal of Linear Algebra 20 (2010), 610620.
6. Rosa, A., On Certain Valuation of The Vertices of A Graph, Theory of Graphs Internat. Sympos. ICC Rome, 1967.
7. Roswitha, M. dan E. T. Baskoro, H-Magic Covering on Some Classes of Graphs, Proceeding
Conference GAiP on ICREMS 1450 (2011).
8. Sedl
acek, J., Theory of Graphs and Its Application, House Czechoslovak Acad. Sci. Prague,
Scotland, 1964.
9. Wallis, W. D, Magic Graph, Birkh
auser, Basel, Berlin, 2001.

2012