Super edge-magic total labeling on w-trees

M. Javaid1 , M. Hussain2 , K. Ali2 , K. H. Dar1

1

Department of Mathematics, GC University,

Lahore, Pakistan
{javaidmath, prof khdar}@yahoo.com

COMSATS Institute of Information Technology,

Lahore, Pakistan
{mhmaths, akashifali}@gmail.com

Abstract. An edge-magic total labeling of a graph G is a one-toone map from V (G) E(G) onto the integers {1, 2, , |V (G)
E(G)|} with the property that, there is an integer constant c such
that (x) + (x, y) + (y) = c for any (x, y) E(G). If (V (G)) =
{1, 2, , |V (G|} then edge-magic total labeling is called super edgemagic total labeling. In this paper we formulate super edge-magic
total labeling on w-trees.

Keywords : Super edge-magic total labeling, w-graph, w-tree.

Introduction

All graphs in this paper are finite, simple, planar and undirected. The
graph G has the vertex-set V (G) and edge-set E(G). A general reference
for graph-theoretic ideas can be seen in [11].
A labeling (or valuation) of a graph is a map that carries graph elements
to numbers (usually to positive or non-negative integers). In this paper the
domain will usually be the set of all vertices and edges and such labelings are
called total labelings. Some labelings use the vertex-set only, or the edge-set
only, and we shall call them vertex-labelings and edge-labelings respectively.
Other domains are possible. There are many types of graph labelings, for
example harmonius, cordial, graceful and antimagic.
In this paper, we focus on one type of labeling called edge-magic total
labeling. An edge-magic total labeling of a graph G is a one-to-one map
from V (G) E(G) onto the integers {1, 2, , |V (G) E(G)|} with the
property that, there is an integer constant c such that (x)+(x, y)+(y) =
c for any (x, y) E(G). An edge-magic total labeling of graph G is called
super edge-magic total labeling if (V (G)) = {1, 2, , |V (G|}.

M. Javaid, M. Hussain, K. Ali, K. H. Dar

The subject of edge-magic total labeling of graphs has its origin in

the work of Kotzig and Rosa [8, 9], on what they called magic valuations
of graphs. The notion of super edge-magic total labeling was introduced
by Enomoto et al. in [2] as super edge-magic total labeling. A number
of classification studies on edge-magic total graphs has been intensively
investigated. For further detail see recent survey of graph labelings [6].
Definition 1. Let G be a graph with set of vertices and edges as
V (G) = {(c1 , c2 , b, w, d) (x1 , x2 , ..., xn ) (y 1 , y 2 , ..., y n )}
E(G) = {(c1 x1 , c1 x2 , ..., c1 xn )(c2 y 1 , c2 y 2 , ..., c2 y n )(c1 b, c1 w)(c2 w, c2 d)},
we shall call it w-graph and it shall be denote by W (n).

2
x x

w y

c1

y y

c2

Fig. 1. W (3)

Definition 2. Suppose that we have k isomorphic copies of w-graphs W (n).

A w-tree W T (n, k) is a tree obtained by taking a new vertex a and joining
it with {di : 1 i k}, where n 2 and k 3.
In this paper we present super edge-magic total labelings for w-tree
as well as for disjoint union of isomorphic and non isomorphic copies of
w-trees.

Main Results

Before giving our main results, let us consider the following lemma found
in [4] that gives a necessary and sufficient condition for a graph to be super
edge-magic total.
Lemma 1. A graph G with v vertices and e edges is super edge-magic
total if and only if there exists a bijective function f : V (G) {1, 2, , v}

Super edge-magic total labeling on w-trees

2

x1 w1 y1

b1 x1

c11

y1 d1 b2 x2

c12

c21

y2 d 2 b 3 x13

x2 w2 y2

c22

3
1

x3 w3 y3

c31

y3 d3

c32

Fig. 2. w-tree W T (2, 3)

such that the set S = {f (x) + f (y)|xy E(G)} consists of e consecutive

integers. In such a case, f extends to a super edge-magic total labeling of
G with magic constant c = v + e + s, where s = min(S) and
S = {f (x) + f (y)|xy E(G)}
= {c (v + 1), c (v + 2), , c (v + e)}.
In the following theorem we define super edge-magic total labeling of wtrees.
Theorem 1. For k 3, G
= W T (n, k) admits super edge-magic total
labeling if n k 1 for even k and n k for odd k.
Proof.
Let v = |V (G)|, e = |E(G)| then v = (2n + 3)k + 2k + 1 and e = (2n + 5)k.
We denote the vertex and edge sets of G as follows:
V (G) = {a} {bi : 1 i k}
{wi : 1 i k} {di : 1 i k}
{ci1 : 1 i k} {ci2 : 1 i k}
{xli : 1 i k, 1 l n}
{yil : 1 i k, 1 l n}

M. Javaid, M. Hussain, K. Ali, K. H. Dar

E(G) = {bi ci1 : 1 i k} {wi ci1 : 1 i k} {wi ci2 : 1 i k}

{di ci2 : 1 i k} {adi : 1 i k}
{ci1 xli : 1 i k, 1 l n}
{ci2 yil : 1 i k, 1 l n}
Before formulating labeling, let s =

k
2

for even k and s =

k1
2

for odd k.

Now, we define the labeling : V {1, 2, ..., v} as follows:

k
(a) = v 2d e
2

(wi ) = (2n + 3)i n 1, 1 i k

f or 1 i s
(2n + 3)k + 2i 1,
(ci1 ) =

(2n + 3)k + 2i + 1,

f or s + 1 i k

(ci2 ) = (2n + 3)k + 2i, 1 i k

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

(di ) =

(2n + 3)i,

f or s + 1 i k

(wi ) + 2i + n 2s + 1,

f or 1 i s

(wi ) + 2i n 2s 3,

f or s + 1 i k

For 1 l n,

(2n + 3)i 2n + l 2,

(xli ) =
(2n + 3)i n + l 1,

For 1 i s,

f or 1 i s

if 1 i s
if s + 1 i k

Super edge-magic total labeling on w-trees

(yil )

(2n + 3)i n + l 1,

(2n + 3)i n + l,

and for s + 1 i k,

(2n + 3)i 2n + l 3,

(yil ) =
(2n + 3)i 2n + l 2,

if 1 l n 2s + 2i
if n 2s + 2i + 1 l n

if 1 l 2i 2s 2
if 2i 2s 1 l n

The set of all edge-sums generated by the above formula forms a consecutive
integer sequence (2n + 3)k + 2, (2n + 3)k + 3, , (2n + 3)k + (2n + 5)k + 1.
Therefore, by Lemma 1 can be extended to a super edge-magic total
labeling and we obtain the magic constant c = v + e + s = (2n + 3)k + 2k +
1 + (2n + 5)k + (2n + 3)k + 2 = 6nk + 13k + 3.
t
u
In the following theorem we formulate super-edge magic total labelings for
disjoint union of non isomorphic copies of w-tree.
Sh W T (n, km ) admits super edge-magic
Theorem 2. For h 2, G =
m=1
Ph
total labeling if n 2 m=1 km 2 and 3 k1 k2 ... kh .
Proof.
Ph
If v = |V (G)| and e = |E(G)| then v = (2n + 5) m=1 km + h and
Ph
e = (2n + 5) m=1 km . We denote the vertex and edge sets of G as follows:
V (G) = {am : 1 m h} {bm
i : 1 i km , 1 m h}
{wim : 1 i km , 1 m h}
{dm
i : 1 i km , 1 m h}
{cm
i1 : 1 i km , 1 m h, }
{cm
i2 : 1 i km , 1 m h, }
{xml
i : 1 i km , 1 m h, 1 l n}
{yiml : 1 i km , 1 m h, 1 l n}
m
E(G) = {bm
i ci1 : 1 i km , 1 m h, }
{wim cm
i1 : 1 i km , 1 m h, }
{wim cm
i2 : 1 i km , 1 m h, }
m
{dm
c
i i2 : 1 i km , 1 m h, }
{am dm
i : 1 i km , 1 m h, }
ml
{cm
x
i1 i : 1 i km , 1 m h, 1 l n}

M. Javaid, M. Hussain, K. Ali, K. H. Dar

ml
{cm
i2 yi : 1 i km , 1 m h, 1 l n}
Now, we define the labeling : V {1, 2, ..., v} as follows:

(am ) = v h + m,

1mh

Throughout the further labeling, we will consider

1 m h, and 1 i km .
(bm
i ) = (2n + 3)(i 1 +

m1
X

kp ) + 1,

p=1

(wim ) = (2n + 3)(i 1 +

m1
X

kp ) + n + 2,

p=1
h
X

(cm
i1 ) = (2n + 3)

km + 2

m=1

kp + 2(i 1) + 1,

p=1

h
X

(cm
i2 ) = (2n + 3)

m1
X

km + 2

m=1

m1
X

kp + 2(i 1) + 2,

p=1

m
(dm
i ) = (w1 ) + (m 1)km + (km m 1)(n + 2 2
(2n + 5)(i 1) + m,

(xml
i )

= (2n + 3)(i 1 +

m1
X

kp ) + l + 1,

Ph
m=1

km ) +

if 1 l n,

p=1

Let = 2i + n m + 2

Pm1
p=1

(yiml ) = (2n + 3)(i 1 +

kp 2

m1
X

Ph
m=1

km + 2 and 1 i km then

kp ) + n + l + 2,

f or 1 l 1,

p=1

and
(yiml ) = (2n + 3)(i 1 +

m1
X

kp ) + n + l + 3,

f or l n,

p=1

The set of all edge-sums generated

by the above formula
Ph
Ph forms a consecutive
integer sequence (2n + 3) m=1 km + 2, (2n + 3) m=1 km + 3, , (2n +

Super edge-magic total labeling on w-trees

Ph
Ph
3) m=1 km + (2n + 5) m=1 km + 1. Therefore, by Lemma 1 can be
extended to a super edge-magicPtotal labeling and we P
obtain the magic
h
h
constant c = v + e + s = (2n + 5) m=1 km + h + (2n + 5) m=1 km + (2n +
Ph
Ph
t
u
3) m=1 km + 2 = (6n + 13) m=1 km + h + 2.
Figure 3 shows all vertices labels of W T (12, 3) W T (12, 4) obtained
by using labeling defined in Theorem 2 and we can see that set of all
edge-sums forms a consecutive integer sequence with initial term s = 1
and hence by using Lemma 1 we have super-edge magic total labeling for
W T (12, 3) W T (12, 4) with c = 183.

M. Javaid, M. Hussain, K. Ali, K. H. Dar

56
55

28

29
30

57

58

60
59

61 62 63

64
65

71
70

76

74
72

75

80

78
77

79

73
81

54
46
48
52
39 41 43
31 32 33 34 35 36 37
50
40
38
51
45
49
42
47
53
44

194
192

66 67 68 69

2 3 4

195

193

6 7 8 9 10 11 12 13 14 16 17 18 19
20 21 22 23 24 25 26 27
15

204
190

191
184 186 189
178 180 182
168 170 172
174 176
164 166
183
177 179 181
163
185 187 188
165 167 169 171 173 175

157 160 162

151 153 155
141 143 145
147 149
137 139
156
140 142 144 146 148
150 152 154
158 161 159
136 138

200

202

203

201

124 126 128 131 133 135

114 116 118
120 122
110 112
129
113 115 117 119 121
123 125 127
132 134 130
109 111

198

199

108
103 105
93 95
87 89
99
91
97
83 85
107
92
94
88
86
90
96
82 84
102 104 106 101
98 100

196

197

Fig. 3.

205

Super edge-magic total labeling on w-trees

By Theorem 2 we have super edge-magic total labeling for isomorphic copies

of w-trees, our assertion is stated in Corollary 1.
Corollary 1 For h 2, G
= hW T (n, k) admits super edge-magic total
labeling if n 2hk 2 and k 3.

Acknowledgement

We are indebted to an anonymous referee for many useful remarks which

improved the first version of this paper.

References
1. M. Baca, Y. Lin, and F. A. Muntaner-Batle, Super edge-antimagic labeling
of path like-trees, Utilitas Math. to appear.
2. H. Enomoto, A. S. Llado, T. Nakamigawa, and G. Ringle, Super edge-magic
graphs, SUT J. Math., 34 (1980), 105-109.
3. Y. Fukuchi, A recursive theorem for super edge-magic labeling of trees, SUT
J. Math., 36 (2000), 279-285.
4. R. M. Figueroa-Centeno, R. Ichishima and F. A. Muntaner-Batle, The place
of super edge-magic labeling among other classes of labeling, Discrete Math.,
231 (2001), 153-168.
5. R. M. Figueroa-Centeno, R. Ichishima, and F. A. Mantaner-Batle, On edgemagic labeling of certain disjoint union graphs, Australas. J. Combin., 32
(2005), 225-242.
6. J. A. Gallian, A dynamic survey of graph labeling, Electronic J. Combin.,
(2008).
7. M. Hussain, E. T. Baskoro, Slamin, On super edge-magic total labeling of
banana trees, Utilitas Math. to appear.
8. A. Kotzig, and A. Rosa, Magic valuations of finite graphs, Canad. Math.
Bull., 13 (1970), 451-461.
9. A. Kotzig, and A. Rosa, Magic valuation of complete graphs, Centre de
Recherches Mathematiques, Universite de Montreal, (1972), CRM-175.
10. S. M. Lee, and Q. X. Shah, All trees with at most 17 vertices are super edgemagic,16th MCCCC Conference, Carbondale, University Southern Illinois,
Nov. (2002).
11. D. B. West, An Introduction to Graph Theory, Prentice-Hall, (1996).