Received November 26, 2018, accepted December 20, 2018, date of publication December 24, 2018,

date of current version January 29, 2019.

Digital Object Identifier 10.1109/ACCESS.2018.2889293

Edge Odd Graceful Labeling of Cylinder

and Torus Grid Graphs
S. N. DAOUD
Department of Mathematics, Faculty of Science, Taibah University, Al-Madinah Al-Munawwarah 41411, Saudi Arabia
Department of Mathematics and Computer Science, Faculty of Science, Menoufia University, Shebin El Kom 32511, Egypt
e-mail: [email protected]
This work was supported by the Deanship of Scientific Research, Taibah University, Al-Madinah Al-Munawwarah, Saudi Arabia.

ABSTRACT Solairaju and Chithra introduced a new type of labeling of a graph G with p vertices and
q edges called an edge odd graceful labeling if there is a bijection f from the edges of the graph to the
set {1, 3, . . . , 2q − 1} such that, when each vertex is assigned the sum of all edges incident to it mod 2q,
the resulting vertex labels are distinct. In this paper, we proved necessary and sufficient conditions for the
cylinder grid graph Cm,n = Pm × Cn and torus grid graph Tm,n = Cm × Cn are edge odd graceful.

INDEX TERMS Graceful labeling, edge odd graceful labeling, cylinder grid graph, torus grid graph.

I. INTRODUCTION In 1985, Lo [4] introduced a labeling of a graph G called

Graph labeling is an active area within graph theory, having edge graceful labeling, which is a bijection f from the set
connections with variety fields of science. Graph Labeling of edges E(G) to the set {1, 2, . . . , q} such that the induced
was first introduced in the 1960’s. A graph labeling is an map f ∗ from the setPof vertices V (G) to {0, 1, 2, . . . , p − 1}
assignment of integers to the vertices or the edges, or both, given by f ∗ (u) = f (uv)(mod p) is a bijection.
subject to certain conditions. Despite the large number of uv∈E(G)
A graph which admits edge graceful labeling is called an
papers in this field of graph theory, there are no general
edge graceful graph.
techniques for labeling different classes of graphs. A com-
The necessary condition for a graph with p vertices and
mon approach in graph labeling is to provide formulas for
q edges to be edge graceful is that q(q + 1) ≡ p(p+1)2 (mod p)
gracefully labeling the given graph.
which is found by Lee [5].
We begin with simple, connected, finite, undirected graph
In 2009, Solairaju and Chithra [6] introduced a labeling of
G = (V (G), E(G)) with p = |V (G)| and q = |E(G)|.
a graph G called edge odd graceful labeling, which is a bijec-
In 1967, Rosa [1] introduced a labeling of a graph G
tion f from the set of edges E(G) to the set {1, 3, . . . , 2q − 1}
called β− valuation, later on Golomb [2] called as ‘‘graceful
such that the induced map f ∗ from the setP of vertices V (G) to
labeling’’ which is an injection f from the set of vertices V (G)
{0, 1, 2, . . . , 2q − 1} given by f ∗ (u) = f (uv)(mod 2q)
to the set {0, 1, 2, . . . , q} such that when each edge e = uv is uv∈E(G)
assigned the label |f (u) − f (v)|, the resulting edge labels are is an injection. A graph which admits edge odd graceful
distinct. A graph which admits a graceful labeling is called a labeling is called an edge odd graceful graph. They proved
graceful graph. that the following graphs are edge odd graceful: Paths with
In 1991, Gnanajothi [3] introduced a labeling of a graph at least 3 vertices; odd cycles; ladders Pn × P2 , n ≥ 3; stars
G called odd graceful labeling which is an injection f from with an even number of edges and crowns Cn  K1 . Recently,
the set of vertices V (G) to the set {0, 1, 2, . . . , 2q − 1} Daoud [7] introduced edge odd graceful labeling of some path
such that when each edge e = uv is assigned the label and cycle related graphs. For a summary of the results on
|f (u) − f (v)|, the resulting edge labels are {1, 3, . . . , 2q − 1}. these four graceful labels as well as all known labels so far,
A graph which admits an odd graceful labeling is called see [8].
an odd graceful graph. She proved that every graph with
an odd cycle is not odd-graceful and the path graph Pn II. EDGE ODD GRACEFUL OF CYLINDER GRID GRAPH
and the cycle graph Cn are odd graceful if and only if is The cylinder grid graph Cm,n is the graph formed from
even n. the Cartesian product Pm × Cn of the path graph Pm and the

2169-3536
2018 IEEE. Translations and content mining are permitted for academic research only.
10568 Personal use is also permitted, but republication/redistribution requires IEEE permission. VOLUME 7, 2019
See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
S. N. Daoud: Edge Odd Graceful Labeling of Cylinder and Torus Grid Graphs

FIGURE 1. Cylinder grid graph Cm,n .

(k)
cycle graph Cn . That is the cylinder grid graph consists Second we label the edges of the circles Cn , 1 ≤ k ≤ m
(1)
of m copies of Cn which represented by circles and will begin with the edges of the inner most circle Cn then the
(m)
be numbered from the inner most circle to the outer cir- edges of outer circle Cn , then the edges of the circles
(1) (2) (3) (m−1) (m)
cle as Cn , Cn , Cn , . . . , Cn , Cn and we call them Cn
(m−2)
, Cn
(m−4) (2)
, . . . , Cn . Finally we label the edges of the
circles, and n copies of Pm which represented by paths circles Cn
(m−1)
, Cn
(m−3) (3)
, . . . , Cn as follows:
transverse the m circles and will be numbered clockwise
(1) (2) (3) (n−1) (n)
as Pm , Pm , Pm , . . . , Pm , Pm and we call them paths.
See Fig.1. f (vi vi+1 ) = 2n(m − 1) + 2i − 1,
Theorem 1: If m is an even positive integer and n ≥ 2, then
f (vn v1 ) = 2mn − 1;
the cylinder grid graph Cm,n , is an edge odd graceful  graph.

Proof:  Using standard
 notation p = V (Cm,n ) = f (vn(m−1)+i vn(m−1)+i+1 )
mn, q = E(Cm,n ) = 2mn − n and f : E(Cm,n ) → = 2mn + 2i − 1,
{1, 3, 5, . . . , 4mn − 2n − 1}.
Let the cylinder grid graph Cm,n be as in Fig.2. f (vmn vn(m−1)+1 ) = 2n(m + 1) − 1;
(k)
First we label the edges of the paths Pm , 1 ≤ k ≤ n f (vn(k−1)+i vn(k−1)+i+1 )
(1)
begin with the edges of the path Pm as follows: = n(3m − k) + 2i − 1,
Move anticlockwise to label the edges v1 vn+1 , vn v2n , vn−1
v2n−1 , . . . , v3 vn+3 , v2 vn+2 by 1, 3, 5, . . . , 2n−3, 2n−1, then f (vkn vn(k−1)+1 ) = n(3m − k + 2) − 1, 2 ≤ k ≤ m − 2,
move clockwise to label the edges vn+1 v2n+1 , vn+2 v2n+2 ,vn+3 k is even, 1 ≤ i ≤ n − 1;
v2n+3 , . . . , v2n−1 v3n−1 , v2n v3n by 2n + 1, 2n + 3, 2n +
5, . . . , 4n − 3, 4n − 1 and so on. Finally move anticlockwise f (vn(k−1)+i vn(k−1)+i+1 )
to label the edges vn(m−2)+1 vn(m−1)+1 , vn(m−1) vmn , vn(m−1)−1 = n(4m − k − 1) + 2i − 1,
vmn−1 , . . . , vn(m−2)+3 vn(m−1)+3 , vn(m−2)+2 vn(m−1)+2 by
f (vkn vn(k−1)+1 ) = n(4m − k + 1) − 1, 3 ≤ k ≤ m − 1,
2n(m − 2) + 1, 2n(m − 2) + 3, 2n(m − 2) + 5, . . . , 2n(m −
1) − 3, 2n(m − 1) − 1. k is odd, 1 ≤ i ≤ n − 1.

VOLUME 7, 2019 10569

 S. N. Daoud: Edge Odd Graceful Labeling of Cylinder and Torus Grid Graphs

FIGURE 2. Cm,n , m is even.

Therefore the labels of corresponding vertices There are two cases:

mod (4mn − 2n) will be Case (1) When n 6 = 6k or 3(2k − 1), k = 1, 2, 3, . . ..
(k)
First we label the edges of the paths Pm , 1 ≤ k ≤ n
f ∗ (vi ) ≡ 2i − 1; f ∗ (vn+i ) ≡ 2mn + 2n + 4i − 2; (1)
begin with the edges of the path Pm as follows:
f ∗ (v2n+i ) ≡ 4n + 4i − 2; Move clockwise to label the edges v1 vn+1 , v2 vn+2 ,
f ∗ (v3n+i ) ≡ 2mn + 6n + 4i − 2; . . . ; v3 vn+3 , . . . , vn−1 v2n−1 , vn v2n by 1, 3, 5, . . . , 2n − 3, 2n − 1,
∗
f (vn(m−3)+i ) ≡ 4mn − 6n + 4i − 2; then move anticlockwise to label the edges vn+1 vn+2 , v2n v3n ,
v2n−1 v3n−1 , . . . , vn+3 v2n+3 , vn+2 v2n+2 by 2n + 1, 2n + 3,
f ∗ (vn(m−2)+i ) ≡ 2mn − 4n + 4i − 2;
2n + 5, . . . , 4n − 3, 4n − 1 and so on. Finally move anti-
f ∗ (vn(m−1)+i ) ≡ 2mn + 2i − 1, 1 ≤ i ≤ n. clockwise to label the edges vn(m−2)+1 vn(m−1)+1 , vn(m−1)
Theorem 2: If m is an odd positive integer greater than 3 vmn , vn(m−1)−1 vmn−1 , . . . , vn(m−2)+3 vn(m−1)+3 , vn(m−2)+2
and n ≥ 2, then the cylinder grid graph Cm,n , is an edge odd vn(m−1)+2 by 2n(m − 2) + 1, 2n(m − 2) + 3, 2n(m − 2) +
graceful graph. 5, . . . , 2n(m − 1) − 3, 2n(m − 1) − 1.
(k)
Proof:  Using standard
 
notation p = V (Cm,n ) = Second we label the edges of the circles Cn , 1 ≤ k ≤ m
(1)

mn, q = E(Cm,n ) = 2mn − n and f : E(Cm,n ) → begin with the edges of the inner most circle Cn then the
(m)
{1, 3, 5, . . . , 4mn − 2n − 1}. edges of outer circle Cn , then the edges of the circles
(m−2) (m−4) (3)
Let the cylinder grid graph Cm,n be as in Fig.3. Cn , Cn , . . . , Cn . Finally we label the edges of the

10570 VOLUME 7, 2019

S. N. Daoud: Edge Odd Graceful Labeling of Cylinder and Torus Grid Graphs

FIGURE 3. Cm,n , m is odd.

(m−1) (m−3) (2)

circles Cn , Cn , . . . , Cn as follows: Therefore the labels of corresponding vertices
mod (4mn − 2n) will be
f (vi vi+1 ) = 2n(m − 1) + 2i − 1,
f (vn v1 ) = 2mn − 1; f ∗ (v1 ) ≡ 1, f ∗ (vi ) ≡ 4mn−4n+6i−5, 2 ≤ i ≤ n;
∗
f (vn(m−1)+i vn(m−1)+i+1 ) = 2mn + 2i − 1, f (vn+i ) ≡ 4i − 2;
f (vmn vn(m−1)+1 ) = 2n(m + 1) − 1; f ∗ (v2n+i ) ≡ 2mn + 4n + 4i − 2;
f (vn(k−1)+i vn(k−1)+i+1 ) = n(3m − k) + 2i − 1, f ∗ (v3n+i ) ≡ 3n + 4i − 2; . . . ;
f ∗ (vn(m−3)+i ) ≡ 4mn − 6n + 4i − 2;
f (vkn vn(k−1)+1 ) = n(3m−k +2)−1, 3 ≤ k ≤ m−2,
k is odd, 1 ≤ i ≤ n − 1; f ∗ (vn(m−2)+i ) ≡ 2mn − 6n + 4i − 2;
f ∗ (vn(m−1)+i ) ≡ 2mn − 1, 1 ≤ i ≤ n.
f (vn(k−1)+i vn(k−1)+i+1 ) = n(4m − k − 1) + 2i − 1,
f (vkn vn(k−1)+1 ) = n(4m−k + v1)−1, 2 ≤ k ≤ m−1, Case (2) When n = 6k or 3(2k − 1), k = 1, 2, 3, . . ..
k is even, 1 ≤ i ≤ n − 1. In this case we get f ∗ (v1 ) = f ∗ (v 3n +1 ) ≡ 1.

VOLUME 7, 2019 10571

 S. N. Daoud: Edge Odd Graceful Labeling of Cylinder and Torus Grid Graphs

To avoid this problem, we interchange the labels of the two by 2m(n − 1) + 1, 2m(n − 1) + 3, 2m(n − 1) + 5, . . . ,
edges v1 v2 and v2 v3 to be as follows: 2mn − 3, 2mn − 1.
(k)
f (v1 v2 ) = 2n(m − 1) + 3 and f (v2 v3 ) = 2n(m − 1) + 1 and Second we label the edges of the circles Cm , 1 ≤ k ≤ n
(1)
so we get: begin with the edges of the inner most circle Cm then the
(n)
edges of the outer circle Cm , then the edges of the circles
f ∗ (v1 ) ≡ 3, f ∗ (v2 ) ≡ 4mn − 4n + 7, (2) (4) (n−2)
Cm , Cm , . . . , Cm . Finally we label the edges of the
f ∗ (v3 ) ≡ 4mn − 4n + 11 (n−1) (n−3) (3)
circles Cm , Cm , . . . , Cm as follows:
and f ∗ (vi )
≡ 4mn − 4n + 6i − 5, 4 ≤ i ≤ n.
The labels of the rest of vertices are as the same as in the f (vi vi+1 ) = 2mn + 2i − 1, 1 ≤ i ≤ m − 1,
case (1). f (vm v1 ) = 2m(n + 1) − 1;
Illustration: The edge odd graceful labeling of the graphs
C6,12 , C6,13 , C7,12 , C7,13 , C7,14 and C7,15 are shown in Fig. 4, f (vm(n−1)+i vm(n−1)+i+1 )
respectively. = 2m(n + 1) + 2i − 1, 1 ≤ i ≤ m − 1,
f (vmn vm(n−1)+1 ) = 2m(n + 2) − 1;
III. EDGE ODD GRACEFUL OF TORUS GRID GRAPH
The torus grid graph Tm,n is the graph formed from f (v( k+2 )m+i v( k+2 )m+i+1 )
2 2
the Cartesian product Cm × Cn of the cycle graphs Cm k +4
and Cn . That is the torus grid graph consists of n copies = 2m(n + ) + 2i − 1,
2
of Cm which represented by circles and will be num-
bered from the inner most circle to the outer circle as: k +4
f (vkm v(k−1)m+1 ) = 2m(n + ) − 1, 2 ≤ k ≤ n − 2,
(1) (2) (3) (n−1) (n) 2
Cm , Cm , Cm , . . . , Cm , Cm and we call them circles,
k is even and 1 ≤ i ≤ m − 1;
and m copies of Cn which represented by ovals or elliptic
shapes transverse the n circles and will be numbered clock- f (v(k−1)m+i v(k−1)m+i+1 )
(1) (2) (3) (m−1) (m)
wise as Cn , Cn , Cn , . . . , Cn , Cn and we call them = m(4n − k + 1) + 2i − 1,
ovals. See Fig.5.
Theorem 3: If n is an even positive integer and m ≥ 2, f (vkm v(k−1)m+1 ) = m(4n − (k − 3)) − 1, 3 ≤ k ≤ n − 1,
then the torus grid graph Tm,n , is an edge odd graceful k is odd and 1 ≤ i ≤ m − 1
graph.
Using
  respectively.
Proof:  standard notation p = V (Tm,n ) = mn,
 
q = E(Tm,n ) = 2mn and f : E(Tm,n ) → {1, 3, 5, . . . ,
 Therefore the labels of corresponding vertices mod 4mn
4mn − 1}. will be:
There are two cases: f ∗ (vi ) ≡ 2mn + 4i − 2,
Case (1): n ≡ 0 mod 4. Let the torus grid graph Tm,n be ∗
f (v2m+i ) ≡ 2mn − 8m + 4i − 2,
as in Fig. 6.
(k)
First we label the edges of the ovals Cn , 1 ≤ k ≤ m begin f ∗ (v4m+i ) ≡ 2mn − 16m + 4i − 2, . . . ,
(1)
with the edges of the oval Cn as follows: Move clockwise f ∗ (vm( n2 −4)+i ) ≡ 16m + 4i − 2,
to label the edges vm(n−1)+1 vm(n−2)+1 , vm(n−1)+2 vm(n−2)+2 , f ∗ (vm( n2 −2)+i ) ≡ 8n + 4i − 2, f ∗ (v mn ) ≡ 4i − 2;
2 +i
vm(n−1)+3 vm(n−2)+3 , . . . , vmn−1 vm(n−1)−1 , vmn vm(n−1) by 1, ∗
f (vm( n2 −1)+i ) ≡ 4m + 4i − 2,
3, 5, . . . , 2m − 3, 2m − 1, then move anticlockwise to label
the edges vm(n−2)+1 vm(n−4)+1 , vm(n−1) vm(n−3) , vm(n−1)−1 f ∗ (vm( n2 +1)+i ) ≡ 12m + 4i − 2,
vm(n−3)−1 , . . . , vm(n−2)+3 vm(n−4)+3 , vm(n−2)+2 vm(n−4)+2 by f ∗ (vm( n2 +3)+i ) ≡ 20m + 4i − 2, . . . ,
2m + 1, 2m + 3, 2m + 5, . . . , 4m − 3, 4m − 1 and so on. f ∗ (vm(n−5)+i ) ≡ 2mn − 12m + 4i − 2,
Then move anticlockwise to label the edges v2m+1 v1 , vm v3m ,
f ∗ (vm(n−3)+i ) ≡ 2mn − 4m + 4i − 2,
vm−1 v3m−1 , . . . , v2m+3 v3 , v2m+2 v2 by m(n − 2) + 1,
m(n − 2) + 3, m(n − 2) + 5, . . . , mn − 3, mn − 1, then move f ∗ (vm(n−1)+i ) ≡ 2mn + 4m + 4i − 2;
clockwise to label the edges v1 vm+1 , v2 vm+2 , v3 vm+3 , . . . , f ∗ (vm+i ) ≡ 2mn + 12m + 4i − 2,
vm−1 v2m−1 , vm v2m by mn + 1, mn + 3, mn + 5, . . . , m(n + f ∗ (v3m+i ) ≡ 2mn + 20m + 4i − 2,
2)−3, m(n+2)−1, then move anticlockwise to label the edges
f ∗ (v5m+i ) ≡ 2mn + 28n + 4i − 2, . . . ,
vm+1 v3m+1 , v2m v4m , v2m−1 v4m−1 , . . . , vm+3 v3m+3 , vm+2 ∗
v3m+2 by m(n + 2) + 1, m(n + 2) + 3, m(n + 2) + 5, . . . , f (vm( n2 −7)+i ) ≡ 4mn − 20m + 4i − 2,
m(n + 4) − 3, m(n + 4) − 1 and so on. f ∗ (vm( n2 −5)+i ) ≡ 4mn − 12m + 4i − 2,
Finally move anticlockwise to label the edges f ∗ (vm( n2 −3)+i ) ≡ 4mn − 4m + 4i − 2;
vm(n−1)+1 vm(n−3)+1 , vmn vm(n−2) , vmn−1 vm(n−2)−1 , . . . , f ∗ (vm(n−2)+i ) ≡ 2mn + 8m + 4i − 2,
vm(n−1)+3 vm(n−3)+3 , vm(n−1)+2 vm(n−3)+2 f ∗ (vm(n−4)+i ) ≡ 2mn + 16m + 4i − 2,

10572 VOLUME 7, 2019

S. N. Daoud: Edge Odd Graceful Labeling of Cylinder and Torus Grid Graphs

FIGURE 4. (a): C6,12 . (b): C6,13 .

VOLUME 7, 2019 10573

 S. N. Daoud: Edge Odd Graceful Labeling of Cylinder and Torus Grid Graphs

FIGURE 4. (Continued.) (c): C7,12 . (d): C7,13 .

10574 VOLUME 7, 2019

S. N. Daoud: Edge Odd Graceful Labeling of Cylinder and Torus Grid Graphs

FIGURE 4. (Continued.) (e): C7,14 . (f): C7,15 .

VOLUME 7, 2019 10575

 S. N. Daoud: Edge Odd Graceful Labeling of Cylinder and Torus Grid Graphs

FIGURE 5. Torus grid graph Tm,n .

f ∗ (vm(n−6)+i ) ≡ 2mn + 24m + 4i − 2, . . . , anticlockwise to label the edges v1 vm+1 , vm v2m , vm−1
∗
f (vm( 2n +6)+i ) ≡ 4mn − 24m + 4i − 2, v2m−1 , . . . , v3 vm+3 , v2 vm+2 by mn + 1, mn + 3, mn +
5, . . . , m(n+2)−3, m(n+2)−1, then move clockwise to label
f ∗ (vm( 2n +4)+i ) ≡ 4mn − 16m + 4i − 2,
the edges vm+1 v3m+1 , vm+2 v3m+2 , vm+3 v3m+3 , . . . , v2m−1
f ∗ (vm( 2n +2)+i ) ≡ 4mn − 8m + 4i − 2, 1 ≤ i ≤ m. v4m−1 , v2m v4m by m(n + 2) + 1, m(n + 2) + 3, m(n + 2) +
5, . . . , m(n + 4) − 3, m(n + 4) − 1 and so on. Finally move
Case (2): n ≡ 2 mod 4. Let the torus grid graph
anticlockwise to label the edges
Tm,n be as in Fig.7. First we label the edges of the
(k)
ovals Cn , 1 ≤ k ≤ m begin with the edges vm(n−1)+1 vm(n−3)+1 , vmn vm(n−2) , vmn−1 vm(n−2)−1 , . . . ,
(1)
of the oval Cn as follows: Move clockwise to label vm(n−1)+3 vm(n−3)+3 , vm(n−1)+2 vm(n−3)+2
the edges vm(n−1)+1 vm(n−2)+1 , vm(n−1)+2 vm(n−2)+2 , vm(n−1)+3
by 2m(n − 1) + 1, 2m(n − 1) + 3, 2m(n − 1) + 5, . . . ,
vm(n−2)+3 , . . . , vmn−1 vm(n−1)−1 , vmn vm(n−1) by 1, 3, 5, . . . ,
2mn − 3, 2mn − 1. The labels of the edges of the
2m − 3, 2m − 1, then move anticlockwise to label the (k)
circles Cm , 1 ≤ k ≤ n are as the same in case (i) without
edges
any change.
vm(n−2)+1 vm(n−4)+1 , vm(n−1) vm(n−3) , vm(n−1)−1 Therefore the labels of corresponding vertices mod 4mn
will be
vm(n−3)−1 , . . . , vm(n−2)+3 vm(n−4)+3 , vm(n−2)+2 vm(n−4)+2
f ∗ (vi ) ≡ 2mn + 4i − 2,
by 2m + 1, 2m + 3, 2m + 5, . . . , 4m − 3, 4m − 1 and so on. ∗
f (v2m+i ) ≡ 2mn − 8m + 4i − 2,
Move clockwise to label the edges v2m+1 v1 , v2m+2 v2 ,
f ∗ (v4m+i ) ≡ 2mn − 16m + 4i − 2, . . . ,
v2m+3 v3 , . . . , v3m−1 vm−1 , v3m vm by m(n−2)+1, m(n−2)+3, ∗
m(n − 2) + 5, . . . , mn − 3, mn − 1, then move f (vm( n2 −5)+i ) ≡ 20m + 4i − 2,

10576 VOLUME 7, 2019

S. N. Daoud: Edge Odd Graceful Labeling of Cylinder and Torus Grid Graphs

FIGURE 6. Tm,n , n ≡ 0 mod 4.

f ∗ (vm( n2 −3)+i ) ≡ 12m + 4i − 2, f ∗ (vm(n−5)+i ) ≡ 2mn − 12m + 4i − 2,

∗
f (vm( n2 −1)+i ) ≡ 4m + 4i − 2; f ∗ (vm(n−3)+i ) ≡ 2mn − 4m + 4i − 2,
∗
f (vm+i ) ≡ 2mn + 12m + 4i − 2, f ∗ (vm(n−1)+i ) ≡ 2mn + 4m + 4i − 2;
∗
f (v3m+i ) ≡ 2mn + 20m + 4i − 2,
f ∗ (vm( n2 +1)+i ) ≡ 4mn − 4m + 4i − 2,
f (v5m+i ) ≡ 2mn + 28m + 4i − 2, . . . ,
∗
∗ f ∗ (vm( n2 +3)+i ) ≡ 4mn − 12m + 4i − 2,
f (vm( 2n −8)+i ) ≡ 4mn − 24m + 4i − 2;
f ∗ (vm( n2 +5)+i ) ≡ 4mn − 20m + 4i − 2, . . . ,
f ∗ (vm( 2n −6)+i ) ≡ 4mn − 16m + 4i − 2,
f ∗ (vm(n−6)+i ) ≡ 2mn + 24m + 4i − 2,
f ∗ (vm( 2n −4)+i ) ≡ 4mn − 8m + 4i − 2;
f ∗ (vm( 2n −2)+i ) ≡ 4i − 2, f ∗ (v mn ) ≡ 8m + 4i − 2, f ∗ (vm(n−4)+i ) ≡ 2mn + 16m + 4i − 2,
2 +i
f ∗ (vm( 2n +2)+i ) ≡ 16m + 4i − 2, . . . , f ∗ (vm(n−2)+i ) ≡ 2mn + 8m + 4i − 2, 1 ≤ i ≤ m.

VOLUME 7, 2019 10577

 S. N. Daoud: Edge Odd Graceful Labeling of Cylinder and Torus Grid Graphs

FIGURE 7. Tm,n , n ≡ 2 mod 4.

Theorem 4: If n is an odd positive integer greater than 1 and Then we label the edges of the right oval as follows:
m is an even positive integer, then the torus grid graph Tm,n , n−3
is an edge odd graceful graph. f (v4k−2 v4k+2 ) = 2n + 4k + 3, 1≤k≤ ;
  2
Proof: Using
 standard notation p = V (Tm,n ) = mn,
 
f (v2n−4 v2n ) = 3;
q = E(Tm,n ) = 2mn and f : E(Tm,n ) → {1, 3, 5, . . . ,

 
4mn − 1}. f (v2n v2n−2 ) = 5;
There are two cases: n−3
f (v2n−4k+2 v2n−4k−2 ) = 4k + 5, 1≤k≤
Case (1): When m = 2. Let the torus grid graph Tm,n , be as 2
in Fig.8. and f (v2 v4 ) = 2n + 3. Then we label the edges of the upper
First we label the edges of the left oval as follows: half circles as follows:

f (v2n−1 v2n−3 ) = 1; f (v1 v2 ) = 4n + 1;f (v2n−1 v2n ) = 4n + 5;

n−3 n−3
f (v2n−(4k−1) v2n−(4k+3) ) = 4k + 3, 1≤k≤ ; f (v4k−1 v4k ) = 4n + 8k + 1, 1 ≤ k ≤ ;
f (v1 v3 ) = 2n + 1; 2 2
n−1 n−3
f (v4k−3 v4k+1 ) = 2n + 4k + 1, 1≤k≤ . f (v2n−4k−1 v2n−4k ) = 4n + 8k + 5, 1 ≤ k ≤
2 2
10578 VOLUME 7, 2019
S. N. Daoud: Edge Odd Graceful Labeling of Cylinder and Torus Grid Graphs

FIGURE 8. T2,n , n ≥ 3.

n−5
and f ∗ (v4k+4 ) ≡ 4n + 8k + 22, 0≤k≤ ;
2
f (v2n−3 v2n−2 ) = 8n − 3. f ∗ (v2n−4 ) ≡ 4; f ∗ (v2n−2 ) ≡ 10;
Finally we label the edges of the lower half circles as follows: f ∗ (v2n−1 ) ≡ 4n + 12; f ∗ (v2n ) ≡ 20.

f (v1 v2 ) = 4n + 3;
f (v2n−1 v2n ) = 4n + 7; Case (2): When m is even positive integer greater than 2.
n−3 This case can be divided it into four subcases.
f (v4k−1 v4k ) = 4n + 8k + 3, 1 ≤ k ≤ ; Subcase (i): m ≡ 0 mod 8. Let the torus grid graph Tm,n
2
n−3 be as in Fig.9.
f (v2n−4k−1 v2n−4k ) = 4n + 8k + 7, 1 ≤ k ≤ (k)
First we label the edges of the ovals Cn , 1 ≤ k ≤ m begin
2 (1)
with the edges of the oval Cn as follows: Move clockwise
and
to label the edges vm(n−1)+1 vm(n−2)+1 , vm(n−1)+2 vm(n−2)+2 ,
f (v2n−3 v2n−2 ) = 8n − 1. vm(n−1)+3 vm(n−2)+3 , . . . , vmn−1 vm(n−1)−1 , vmn vm(n−1) by
1, 3, 5, . . . , 2m − 3, 2m − 1, then move anticlockwise to label
Therefore the labels of corresponding vertices mod 8n the edges vm(n−2)+1 vm(n−4)+1 , vm(n−1) vm(n−3) , vm(n−1)−1
will be: vm(n−3)−1 , . . . , vm(n−2)+3 vm(n−4)+3 , vm(n−2)+2 vm(n−4)+2 by
n−3 2m + 1, 2m + 3, 2m + 5, . . . , 4m − 3, 4m − 1 and so on.
f ∗ (v4k+1 ) ≡ 4n − 8k + 10, 0 ≤ k ≤ ,
2 Move anticlockwise to label the edges vm+1 v1 , v2m vm ,
n−5 v2m−1 vm−1 , . . . , vm+3 v3 , vm+2 v2 by m(n − 1) + 1, m(n −
f ∗ (v4k+2 ) ≡ 4n − 8k + 14, 0 ≤ k ≤ ;
2 1) + 3, m(n − 1) + 5, . . . , m(n + 1) − 3, m(n + 1) − 1,
n−5 then move clockwise to label the edges v1 v2m+1 , v2 v2m+2 ,
f ∗ (v4k+3 ) ≡ 4n − 8k + 18, 0 ≤ k ≤ ;
2 v3 v2m+3 , . . . , vm−1 v3m−1 , vm v3m by m(n + 1) + 1,

VOLUME 7, 2019 10579

 S. N. Daoud: Edge Odd Graceful Labeling of Cylinder and Torus Grid Graphs

FIGURE 9. Tm,n , n ≡ 0 mod 8.

m(n + 1) + 3, m(n + 1) + 5, . . . , m(n + 3) − 3, f (v3 v4 ) = 2mn + 5,

m(n + 3) − 1, then move anticlockwise to label the f (v4 v5 ) = 2mn + 7,
edges v2m+1 v4m+1 , v3m v5m , v3m−1 v5m−1 , . . . , v2m+3 v4m+3 ,
f (v5 v6 ) = 2mn + 11,
v2m+2 v4m+2 by m(n + 3) + 1, m(n + 3) + 3, m(n + 3) +
5, . . . , m(n + 5) − 3, m(n + 5) − 1 and so on. f (v6 v7 ) = 2mn + 9,
Finally move anticlockwise to label the edges vm(n−3)+1 f (v7 v8 ) = 2mn + 13,
vm(n−1)+1 , vm(n−3)+2 vm(n−1)+2 , vm(n−3)+3 vm(n−1)+3 , . . . , f (v8 v9 ) = 2mn + 15, . . . ,
vm(n−2)−1 vmn−1 , vm(n−2) vmn by 2m(n − 1) + 1, 2m(n − 1) +
f (vm−5 vm−4 ) = m(2n + 1) − 11,
3, 2m(n − 1) + 5, . . . , 2mn − 3, 2mn − 1.
(k) f (vm−4 vm−3 ) = m(2n + 1) − 9,
Second we label the edges of the circles Cm , 1 ≤ k ≤ n
(1)
begin with the edges of the inner most circle Cm as follows: f (vm−3 vm−2 ) = m(2n + 1) − 5,
f (v1 v2 ) = 2mn + 3, f (vm−2 vm−1 ) = m(2n + 1) − 7,
f (v2 v3 ) = 2mn + 1, f (vm−1 vm ) = m(2n + 1) − 3

10580 VOLUME 7, 2019

S. N. Daoud: Edge Odd Graceful Labeling of Cylinder and Torus Grid Graphs

and f ∗ (v9 ) ≡ 2mn + 2m + 36,

f (vm v1 ) = 2m(n + 1) − 1. f ∗ (v10 ) ≡ 2mn + 2m + 38, . . . ,
(n) f ∗ (vm−7 ) ≡ 2mn + 6m − 28,
Then we label of the edges of outer circle Cm as follows:
f ∗ (vm−6 ) ≡ 2mn + 6m − 26,
f (vm(n−1)+i vm(n−1)+i+1 ) = 2m(n + 1) + 2i − 1, f ∗ (vm−5 ) ≡ 2mn + 6m − 24,
1 ≤ i ≤ m − 2, f ∗ (vm−4 ) ≡ 2mn + 6m − 18,
f (vmn−1 vmn ) = 2m(n + 2) − 1 f ∗ (vm−3 ) ≡ 2mn + 6m − 12,
and f ∗ (vm−2 ) ≡ 2mn + 6m − 10,
f (vmn vm(n−1)+1 ) = 2m(n + 2) − 3. f ∗ (vm−1 ) ≡ 2mn + 6m − 8,
(2) f ∗ (vm ) ≡ 2mn + 6m − 2.
Then we label of the edges of the circle Cm as follows:
(n)
The labels of vertices of outer circle Cm mod 4mn are as
f (vm+1 vm+2 ) = 2m(n + 2) + 1,
follows:
f (vm+2 vm+3 ) = 2m(n + 2) + 3,
f (vm+3 vm+4 ) = 2m(n + 2) + 7, f ∗ (vm(n−1)+1 ) ≡ 2mn + 4m,
f (vm+4 vm+5 ) = 2m(n + 2) + 5, f ∗ (vm(n−1)+i ) ≡ 2mn + 2m + 8i − 6, 2 ≤ i ≤ m − 2,
∗
f (vm+5 vm+6 ) = 2m(n + 2) + 9, f (vmn−1 ) ≡ 2mn + 10m − 12,
f (vm+6 vm+7 ) = 2m(n + 2) + 11, f ∗ (vmn ) ≡ 2mn + 10m − 6.
(2)
f (vm+7 vm+8 ) = 2m(n + 2) + 15, The labels of vertices of the circle Cm mod 4mn are as
f (vm+8 vm+9 ) = 2m(n + 2) + 13, . . . , follows:
f (v2m−6 v2m−5 ) = 2m(n + 3) − 13, f ∗ (vm+1 ) ≡ 2mn + 6m,
f (v2m−5 v2m−4 ) = 2m(n + 3) − 9, f ∗ (vm+2 ) ≡ 2mn + 6m + 6,
f (v2m−4 v2m−3 ) = 2m(n + 3) − 11, f ∗ (vm+3 ) ≡ 2mn + 6m + 12,
f (v2m−3 v2m−2 ) = 2m(n + 3) − 7, f ∗ (vm+4 ) ≡ 2mn + 6m + 14,
f (v2m−2 v2m−1 ) = 2m(n + 3) − 5, f ∗ (vm+5 ) ≡ 2mn + 6m + 16,
f (v2m−1 v2m ) = 2m(n + 3) − 1 f ∗ (vm+6 ) ≡ 2mn + 6m + 22,
and f (v2m vm+1 ) = 2m(n + 3) − 3. Then we label of the edges f ∗ (vm+7 ) ≡ 2mn + 6m + 28,
(3) (5) (n−2)
of the circles Cm , Cm , . . . , Cm as follows : f ∗ (vm+8 ) ≡ 2mn + 6m + 30, . . . ,
k −1 f ∗ (v2m−6 ) ≡ 2mn + 10m − 26,
f (v(k−1)m+i v(k−1)m+i+1 ) = 4m(n − ) + 2i − 1
2 f ∗ (v2m−5 ) ≡ 2mn + 10m − 20,
and f ∗ (v2m−4 ) ≡ 2mn + 10m − 18,
f (vkm v(k−1)m+1 ) = 4m(n − (2k − 4)) − 1, k f ∗ (v2m−3 ) ≡ 2mn + 10m − 16,
is odd, 3 ≤ k ≤ n − 2 and 1 ≤ i ≤ m − 1. Finally we label f ∗ (v2m−2 ) ≡ 2mn + 10m − 10,
(4) (6) (n−1)
the edges of the circles Cm , Cm , . . . , Cm as follows: f ∗ (v2m−1 ) ≡ 2mn + 10m − 4,
f (v(k−1)m+i v(k−1)m+i+1 ) = 2m(n + k) + 2i − 1 f ∗ (v2m ) ≡ 2mn + 10m − 2.
(3) (5) (n−2)
and f (vkm v(k−1)m+1 ) = 2m(n + k + 1) − 1, k is even, 4 ≤ k ≤ The labels of vertices of the circles Cm , Cm , . . . , Cm
n − 1 and 1 ≤ i ≤ m − 1. mod 4mn are as follows:
Thus we have the labels of the vertices of inner most f ∗ (vkm+i ) ≡ 2mn − 2(k − 1)m + 4i − 2, 2 ≤ k ≤ n − 3,
(1)
circle Cm mod 4mn are as follows:
k is even and 1 ≤ i ≤ m.
f ∗ (v1 ) ≡ 2mn + 2m + 4, (4) (6) (n−1)
The labels of vertices of circles Cm , Cm , . . . , Cm mod
f ∗ (v2 ) ≡ 2mn + 2m + 6,
4mn are as follows:
f ∗ (v3 ) ≡ 2mn + 2m + 8,
f ∗ (v4 ) ≡ 2mn + 2m + 14, f ∗ (vkm+i ) ≡ 2mn + 2(k + 2)m + 4i − 2, 3 ≤ k ≤ n − 2,
f ∗ (v5 ) ≡ 2mn + 2m + 20, k is odd and 1 ≤ i ≤ m.
∗
f (v7 ) ≡ 2mn + 2m + 24, Subcase (ii): m ≡ 2 mod 8. Consider Fig.9 with some
∗ (1) (2)
f (v8 ) ≡ 2mn + 2m + 30, changes in the labels of the edges of circles Cm and Cm

VOLUME 7, 2019 10581

 S. N. Daoud: Edge Odd Graceful Labeling of Cylinder and Torus Grid Graphs

(k)
and the labels of the edges of circles Cm , 3 ≤ k ≤ n are as f ∗ (vm−5 ) ≡ 2mn+6m − 22, f ∗ (vm−4 ) ≡ 2mn + 2m − 20,
the same in subcase (i). f ∗ (vm−3 ) ≡ 2mn + 6m − 12, f ∗ (vm−2 ) ≡ 2mn + 6m − 10,
(1)
Label the edges of the circles Cm as follows:
f ∗ (vm−1 ) ≡ 2mn + 6m − 8, f ∗ (vm ) ≡ 2mn + 6m − 2.
f (v1 v2 ) = 2mn + 1, f (v2 v3 ) = 2mn + 3, (2)
The labels of the vertices of the circle Cm mod 4mn are as
f (v3 v4 ) = 2mn + 7, f (v4 v5 ) = 2mn + 5, follows:
f (v5 v6 ) = 2mn + 9, f (v6 v7 ) = 2mn + 11,
f ∗ (vm+1 ) ≡ 2mn + 6m, f ∗ (vm+2 ) ≡ 2mn + 6m + 6,
f (v7 v8 ) = 2mn + 15, f (v8 v9 ) = 2mn + 13,
f ∗ (vm+3 ) ≡ 2mn + 6m + 12, f ∗ (vm+4 ) ≡ 2mn + 6m + 14,
f (v9 v10 ) = 2mn + 17, . . . ,
f ∗ (vm+5 ) ≡ 2mn + 6n + 16, f ∗ (vm+6 ) ≡ 2mn + 6m + 22,
f (vm−7 vm−6 ) = 2m(n + 1) − 13,
f ∗ (vm+7 ) ≡ 2mn + 6m + 26, f ∗ (vm+8 ) ≡ 2mn + 6m + 30,
f (vm−6 vm−5 ) = 2m(n + 1) − 15,
f ∗ (vm+9 ) ≡ 2mn + 6m + 36,
f (vm−5 vm−4 ) = 2m(n + 1) − 11,
f ∗ (vm+10 ) ≡ 2mn + 6m + 38, . . . ,
f (vm−4 vm−3 ) = 2m(n + 1) − 9,
f ∗ (v2m−5 ) ≡ 2mn + 10m − 20,
f (vm−3 vm−2 ) = 2m(n + 1) − 5,
f ∗ (v2m−4 ) ≡ 2mn + 10m − 18,
f (vm−2 vm−1 ) = 2m(n + 1) − 7,
f ∗ (v2m−3 ) ≡ 2mn + 10m − 14,
f (vm−1 vm ) = 2m(n + 1) − 3
f ∗ (v2m−2 ) ≡ 2mn + 10m − 10,
and f ∗ (v2m−1 ) ≡ 2mn + 10m − 4, f ∗ (v2m ) ≡ 2mn + 10m − 2.
f (vn v1 ) = 2m(n + 1) − 1. The labels of the rest of vertices are as the same as in the in
Label the edges of the circles
(2)
Cm as follows: subcase (i).
Subcase (iii): m ≡ 4 mod 8. Consider Fig.9 with some
f (vm+1 vm+2 ) = 2m(n + 2) + 1, (1) (2)
changes in the labels of the edges of circles Cm and Cm
(k)
f (vm+2 vm+3 ) = 2m(n + 2) + 3, and the labels of the edges of circles Cm , 3 ≤ k ≤ n are as
f (vm+3 vm+4 ) = 2m(n + 2) + 7, the same in subcase (i).
(1)
Label the edges of the circles Cm as follows:
f (vm+4 vm+5 ) = 2m(n + 2) + 5,
f (vm+5 vm+6 ) = 2m(n + 2) + 9, f (v1 v2 ) = 2mn + 1, f (v2 v3 ) = 2mn + 3,
f (vm+6 vm+7 ) = 2m(n + 2) + 11, f (v3 v4 ) = 2mn + 7, f (v4 v5 ) = 2mn + 5,
f (vm+7 vm+8 ) = 2m(n + 2) + 15, f (v5 v6 ) = 2mn + 9, f (v6 v7 ) = 2mn + 11,
f (vm+8 vm+9 ) = 2m(n + 2) + 13, . . . , f (v7 v8 ) = 2mn + 15, f (v8 v9 ) = 2mn + 13, . . . ,
f (v2m−7 v2m−6 ) = 2m(n + 3) − 15, f (vm−5 vm−4 ) = 2m(n + 1) − 9,
f (v2m−6 v2m−5 ) = m(n + 3) − 13, f (vm−4 vm−3 ) = 2m(n + 1) − 11,
f (v2m−5 v2m−4 ) = 2m(n + 3) − 9, f (vm−3 vm−2 ) = 2m(n + 1) − 7,
f (v2m−4 v2m−3 ) = 2m(n + 3) − 11, f (vm−2 vm−1 ) = 2m(n + 1) − 5,
f (v2m−3 v2m−2 ) = 2m(n + 3) − 7, f (vm−1 vm ) = 2m(n + 1) − 1
f (v2m−2 v2m−1 ) = 2m(n + 3) − 5, and
f (v2m−1 v2m ) = 2m(n + 3) − 1
f (vn v1 ) = 2m(n + 1) − 3.
and (2)
Label the edges of the circles Cm as follows:
f (v2m vm+1 ) = 2m(n + 3) − 3.
f (vm+1 vm+2 ) = 2m(n + 2) + 1,
(1)
Thus we have the labels of the vertices of the circle Cm mod f (vm+2 vm+3 ) = 2m(n + 2) + 3,
4mn are as follows: f (vm+3 vm+4 ) = 2m(n + 2) + 7,
f ∗ (v1 ) ≡ 2mn + 2m + 2, f ∗ (v2 ) ≡ 2mn + 2m + 6, f (vm+4 vm+5 ) = 2m(n + 2) + 5,
∗ ∗
f (v3 ) ≡ 2mn + 2m + 12, f (v4 ) ≡ 2mn + 2m + 14, f (vm+5 vm+6 ) = 2m(n + 2) + 9,
∗ ∗
f (v5 ) ≡ 2mn + 2m + 16, f (v6 ) ≡ 2mn + 2m + 22, f (vm+6 vm+7 ) = 2m(n + 2) + 11,
∗ ∗
f (v7 ) ≡ 2mn + 2m + 28, f (v8 ) ≡ 2mn + 2m + 30, f (vm+7 vm+8 ) = 2m(n + 2) + 15,
f ∗ (v9 ) ≡ 2mn + 2m + 32, f (vm+8 vm+9 ) = 2m(n + 2) + 13, . . . ,
f (v10 ) ≡ 2mn + 2m + 38, . . . ,
∗
f (vm+7 vm+8 ) = 2m(n + 2) + 15,

10582 VOLUME 7, 2019

S. N. Daoud: Edge Odd Graceful Labeling of Cylinder and Torus Grid Graphs

f (vm+8 vm+9 ) = 2m(n + 2) + 13, . . . , f (vm−5 vm−4 ) = 2m(n + 1) − 9,

f (v2m−5 v2m−4 ) = 2m(n + 2) − 9, f (vm−4 vm−3 ) = 2m(n + 1) − 11,
f (v2m−4 v2m−3 ) = 2m(n + 3) − 11, f (vm−3 vm−2 ) = 2m(n + 1) − 7,
f (v2m−3 v2m−2 ) = 2m(n + 3) − 7, f (vm−2 vm−1 ) = 2m(n + 1) − 5,
f (v2m−2 v2m−1 ) = 2m(n + 3) − 5, f (vm−1 vm ) = 2m(n + 1) − 1,
f (v2m−1 v2m ) = 2m(n + 3) − 1, and f (vm v1 ) = 2m(n + 1) − 3.
(2)
and Label the edges of the circles Cm as follows:

f (v2m vm+1 ) = 2m(n + 3) − 3. f (vm+1 vm+2 ) = 2m(n + 2) + 1,

f (vm+2 vm+3 ) = 2m(n + 2) + 3,
Thus we have the labels of the vertices of the circle
(1)
Cm mod 4mn are as follows: f (vm+3 vm+4 ) = 2m(n + 2) + 7,
f (vm+4 vm+5 ) = 2m(n + 2) + 5,
f ∗ (v1 ) ≡ 2mn + 2m, f ∗ (v2 ) ≡ 2mn + 2m + 6,
f (vm+5 vm+6 ) = 2m(n + 2) + 9,
f ∗ (v3 ) ≡ 2mn + 2m + 12, f ∗ (v4 ) ≡ 2mn + 2m + 14,
f (vm+6 vm+7 ) = 2m(n + 2) + 11,
f ∗ (v5 ) ≡ 2mn + 2m + 16,
f (vm+7 vm+8 ) = 2m(n + 2) + 15, . . . ,
f ∗ (v6 ) ≡ 2mn + 2m + 22, f ∗ (v7 ) ≡ 2mn + 2m + 28,
f (v2m−5 v2m−4 ) = 2m(n + 3) − 9,
f ∗ (v8 ) ≡ 2mn + 2m + 30, f ∗ (v9 ) ≡ 2mn + 2m + 32,
f (v2m−4 v2m−3 ) = 2m(n + 3) − 11,
f ∗ (v10 ) ≡ 2mn + 2m + 38, . . . ,
f (v2m−3 v2m−2 ) = 2m(n + 3) − 7,
f ∗ (vm−5 ) ≡ 2mn + 6m − 20, f ∗ (vm−4 ) ≡ 2mn + 6m − 18,
f (v2m−2 v2m−1 ) = 2m(n + 3) − 5,
f ∗ (vm−3 ) ≡ 2mn + 6m − 16, f ∗ (vm−2 ) ≡ 2mn+6m − 10,
f (v2m−1 v2m ) = 2m(n + 3) − 1
f ∗ (vm−1 ) ≡ 2mn + 6m − 4, f ∗ (vm ) ≡ 2mn + 6m − 2.
(2)
and
The labels of the vertices of the circle Cm mod 4mn are as
follows: f (v2m vm+1 ) = 2m(n + 3) − 3.
(1)
f ∗ (vm+1 ) ≡ 2mn + 6m, f ∗ (vm+2 ) ≡ 2mn + 6m + 6, Thus we have the labels of the vertices of the circle Cm mod
f ∗ (vm+3 ) ≡ 2mn+6m+12, f ∗ (vm+4 ) ≡ 2mn+2m+14, 4mn are as follows:
f ∗ (vm+5 ) ≡ 2mn+6m+16, f ∗ (vm+6 ) ≡ 2mn+6m+22, f ∗ (v1 ) ≡ 2mn + 2m + 2,
f ∗ (vm+7 ) ≡ 2mn+6m+28, f ∗ (vm+8 ) ≡ 2mn+6m+30, f ∗ (v2 ) ≡ 2mn + 2m + 6,
f ∗ (vm+9 ) ≡ 2mn + 6m + 32, f ∗ (v3 ) ≡ 2mn + 2m + 8,
f (vm+10 ) ≡ 2mn + 6m + 38, . . . ,
∗
f ∗ (v4 ) ≡ 2mn + 2m + 14,
∗
f (v2m−5 ) ≡ 2mn + 10m − 20, f ∗ (v5 ) ≡ 2mn + 2m + 20,
f ∗ (v2m−4 ) ≡ 2mn + 10m − 18, f ∗ (v6 ) ≡ 2mn + 2m + 22,
f ∗ (v2m−3 ) ≡ 2mn + 10m − 16, f ∗ (v7 ) ≡ 2mn + 2m + 24,
∗
f (v2m−2 ) ≡ 2mn + 10m − 10, f ∗ (v8 ) ≡ 2mn + 2m + 30,
∗
f (v2m−1 ) ≡ 2mn + 10m − 4, f ∗ (v9 ) ≡ 2mn + 2m + 36,
f ∗ (v2m ) ≡ 2mn + 10m − 2; f ∗ (v10 ) ≡ 2mn + 2m + 38, . . . ,
The labels of the rest of vertices are as the same as in the f ∗ (vm−5 ) ≡ 2mn + 6m − 20,
subcase (i). f ∗ (vm−4 ) ≡ 2mn + 6m − 18,
Subcase (iv): m ≡ 6 mod 8. Consider Fig.9 with some f ∗ (vm−3 ) ≡ 2mn + 6m − 16,
(1) (2)
changes in the labels of the edges of circles Cm and Cm f ∗ (vm−2 ) ≡ 2mn + 6m − 10,
(k)
and the labels of the edges of circles Cm , 3 ≤ k ≤ n are as
f ∗ (vm−1 ) ≡ 2mn + 6m − 4,
the same in subcase (i).
(1)
Label the edges of the circles Cm as follows: f ∗ (vm ) ≡ 2mn + 6m − 2.
(2)
f (v1 v2 ) = 2mn + 3, f (v2 v3 ) = 2mn + 1, The labels of the vertices of the circle Cm mod 4mn are as
f (v3 v4 ) = 2mn + 5, f (v4 v5 ) = 2mn + 7, follows:
f (v5 v6 ) = 2mn + 11, f (v6 v7 ) = 2mn + 9, f ∗ (vn+1 ) ≡ 2mn + 6m,
f (v7 v8 ) = 2mn + 13, f (v8 v9 ) = 2mn + 15, . . . , f ∗ (vm+2 ) ≡ 2mn + 6m + 6,

VOLUME 7, 2019 10583

 S. N. Daoud: Edge Odd Graceful Labeling of Cylinder and Torus Grid Graphs

(n−2)
f ∗ (vm+3 ) ≡ 2mn + 6m + 12, Cm mod 4mn are as follows:
∗
f (vm+4 ) ≡ 2mn + 6m + 14,
f ∗ (v(k−1)m+1 ) ≡ 2mn + (4k − 2)m + 2,
f ∗ (vm+5 ) ≡ 2mn + 6m + 16,
1 ≤ k ≤ n − 2, k is odd.
f ∗ (vm+6 ) ≡ 2mn + 6m + 22,
f ∗ (vn+7 ) ≡ 2mn + 2m + 28, That is in case n ≡ 1 mod 4, we have
∗
f (vm+8 ) ≡ 2mn + 6m + 30, f ∗ (v1 ) ≡ 2mn + 2m + 2,
∗
f (vm+9 ) ≡ 2mn + 6m + 32, f ∗ (v2n+1 ) ≡ 2mn + 10m + 2,
f (vm+10 ) ≡ 2mn + 6m + 38, . . . ,
∗
f ∗ (v4m+1 ) ≡ 2mn + 18m + 2, . . . ,
∗
f (v2m−7 ) ≡ 2mn + 10m − 26, f ∗ (vm( n−5 )+1 ) ≡ 4mn − 8m + 2,
f ∗ (v2m−6 ) ≡ 2mn + 10m − 24, 2
f ∗ (vm( n−1 )+1 ) ≡ 2,
f ∗ (v2m−5 ) ≡ 2mn + 10m − 22, 2
f ∗ (vm( n+3 )+1 ) = 8n + 2, . . . ,
f ∗ (v2m−4 ) ≡ 2mn + 10m − 16, 2
∗ f ∗ (vm(n−5)+1 ) ≡ 2mn − 18m + 2,
f (v2m−3 ) ≡ 2mn + 10m − 12,
f ∗ (vm(n−3)+1 ) ≡ 2mn − 10m + 2
f ∗ (v2m−2 ) ≡ 2mn + 10m − 8,
f ∗ (v2m−1 ) ≡ 2mn + 10m − 4, and in case n ≡ 3 mod 4, we have
∗
f (v2m ) ≡ 2mn + 10m − 2.
f ∗ (v1 ) ≡ 2mn + 2m + 2,
The labels of the rest of vertices are as the same as in the ∗
f (v2m+1 ) ≡ 2mn + 10m + 2,
subcase (i).
Theorem 5: If m and n are odd positive integers greater f ∗ (v4m+1 ) ≡ 2mn + 18m + 2, . . . ,
than 1, then the torus grid graph Tm,n is an edge odd graceful f ∗ (vm( n−3 )+1 ) ≡ 4mn − 4m + 2,
2
graph.   f ∗ (vm( n+1 )+1 ) ≡ 4m + 2,
Using 2
Proof:  standard notation p = V (Tm,n ) = mn,
 
q = E(Tm,n ) = 2mn and f : E(Tm,n ) → {1, 3, 5, . . . ,
 f ∗ (vm( n+5 )+1 ) ≡ 12m + 2, . . . ,
2
4mn − 1}. f ∗ (vm(n−5)+1 ) ≡ 2mn − 18m + 2,
Let the torus grid graph Tm,n , be as in Fig.10. f ∗ (vm(n−3)+1 ) ≡ 2mn − 10m + 2.
(1) (3) (n−2)
First we label the edges of the circles Cm , Cm , . . . ,Cm ,
(n) (1) (3)
Cm clockwise as follows: The labels of the rest vertices of the circles Cm , Cm , . . . ,
(n−2) (n)
Cm , Cm mod 4mn are as follows:
f (v(k+1)m+1 vkm+1 ) = (k + 2)m − 1,
f (vkm+i vkm+i+1 ) = km + 2i − 1, 1 ≤ i ≤ m − 1, f ∗ (v(k−1)m+i+1 ) ≡ 2mn + 4(k − 1)m + 8i + 2,
0 ≤ k ≤ n − 1, k is even. 1 ≤ i ≤ m − 1, 1 ≤ k ≤ n − 2, k is odd.
(n−1) (n−3) (4)
Then we label the edges of the circles Cm ,Cm , . . . ,Cm , That is in case n ≡ 1 mod 4, we have
(2)
Cm clockwise as follows:
f (v(k+1)m vkn+1 ) = 2mn − (k − 1)m − 1, f ∗ (vi+1 ) ≡ 2mn + 8i + 2,
f (vkm+i vkm+i+1 ) = 2mn − (k + 1)m + 2i − 1, 1 ≤ i ≤ m−1, f ∗ (v2m+i+1 ) ≡ 2mn + 8m + 8i + 2, . . . ,
1 ≤ k ≤ n − 2, k is odd. f ∗ (vm( n−5 )+i+1 ) ≡ 4mn − 10m + 8i + 2,
2
(k) f ∗ (vm( n−1 )+i+1 ) ≡ 4mn − 2m + 8i + 2,
Second we label the edges of the ovals Cn , 1 ≤ k ≤ m 2

clockwise begin with

(1)
the edges of the oval Cn as follows: f ∗ (vm( n+3 )+i+1 ) ≡ 6m + 8i + 2, . . . ,
2

f (vm(n−1)+i vm(n−2)+i ) = 2mn + 2i − 1, 1 ≤ i ≤ m; f ∗ (vm(n−3)+i+1 ) ≡ 2mn − 12m + 8i + 2, 1 ≤ i ≤ m − 1,

f (vkm+i v(k+2)m+i ) = 3mn−(k +2)m+ 2i − 1, 1 ≤ i ≤ m, and in case n ≡ 3 mod 4, we have
1 ≤ k ≤ n − 4, k is odd;
f ∗ (vi+1 ) ≡ 2mn + 8i + 2,
f (vm+i vi ) = m(3n − 1) + 2i − 1,
f ∗ (v2m+i+1 ) ≡ 2mn + +8m + 8i + 2, . . . ,
1 ≤ i ≤ m;
f ∗ (vm( n−3 )+i+1 ) ≡ 4mn − 6m + 8i + 2,
f (vkm+i v(k+2)m+i ) = 3mn + (k + 1)m + 2i − 1, 2

1 ≤ i ≤ m, 0 ≤ k ≤ n−3, k is even. f ∗ (vm( n+1 )+i+1 ) ≡ 2m + 8i + 2,

2

Thus we have the labels of the set of vertices in the inter- f ∗ (vm( n+5 )+i+1 ) ≡ 10m + 8i + 2, . . . ,
2
(1) (3) (n−4)
section of the oval Cn1 and the circles Cm , Cm , . . . , Cm , f ∗ (vm(n−3)+i+1 ) ≡ 2mn − 12m + 8i + 2, 1 ≤ i ≤ m − 1.

10584 VOLUME 7, 2019

S. N. Daoud: Edge Odd Graceful Labeling of Cylinder and Torus Grid Graphs

FIGURE 10. Tm,n , m and n are odd ≥ 3.

The labels of vertices of the set of vertices in the intersec- f ∗ (vm( n−7 )+1 ) ≡ 12m + 2,
(n−1) (n−3) (4) 2
tion of the oval Cn1 and the circles Cm , Cm , . . . , Cm , f ∗ (vm( n−3 )+1 ) ≡ 4m + 2,
(2)
Cm mod 4mn are as follows: 2
f ∗ (vm( n+1 )+1 ) ≡ 4mn − 4m + 2, . . . ,
2
f ∗ (v(k+1)m+1 ) ≡ 2mn − (4k + 6)m + 2, f ∗ (vm(n−4)+1 ) ≡ 2mn + 14m + 2,
0 ≤ k ≤ n − 1, k is even. f ∗ (vm(n−2)+1 ) ≡ 2mn + 6m + 2
That is in case n ≡ 1 mod 4, we have and in case n ≡ 3 mod 4, we have
f ∗ (vm+1 ) ≡ 2mn − 6m + 2, f ∗ (vm+1 ) ≡ 2mn − 6m + 2,
∗
f (v3m+1 ) ≡ 2mn − 14m + 2, f ∗ (v3m+1 ) ≡ 2mn − 14m + 2,
f ∗ (v5m+1 ) ≡ 2mn − 22m + 2, . . . , f ∗ (v5m+1 ) ≡ 2mn − 22m + 2, . . . ,

VOLUME 7, 2019 10585

 S. N. Daoud: Edge Odd Graceful Labeling of Cylinder and Torus Grid Graphs

FIGURE 11. (a): T9,8 . (b): T10,8 .

10586 VOLUME 7, 2019

S. N. Daoud: Edge Odd Graceful Labeling of Cylinder and Torus Grid Graphs

FIGURE 11. (Continued.) (c): T9,6 . (d): T10,6 .

VOLUME 7, 2019 10587

 S. N. Daoud: Edge Odd Graceful Labeling of Cylinder and Torus Grid Graphs

FIGURE 11. (Continued.) (e): T8,7 . (f): T10,7 .

10588 VOLUME 7, 2019

S. N. Daoud: Edge Odd Graceful Labeling of Cylinder and Torus Grid Graphs

FIGURE 11. (Continued.) (g): T12,7 . (h): T14,7 .

VOLUME 7, 2019 10589

 S. N. Daoud: Edge Odd Graceful Labeling of Cylinder and Torus Grid Graphs

FIGURE 11. (Continued.) (i): T7,9 . (j): T9,7 .

10590 VOLUME 7, 2019

S. N. Daoud: Edge Odd Graceful Labeling of Cylinder and Torus Grid Graphs

f ∗ (vm( n−5 )+1 ) ≡ 8m + 2, mining is a special case of structured data mining. In data
2
∗
f (vm( n−1 )+1 ) ≡ 2, mining graphs can be more widely used because the outputs
2 of data mining can be represented in graphs.
f ∗ (vm( n+3 )+1 ) ≡ 4mn − 8m + 2, . . . , 2. Labeling of a binary image is the operation of assigning
2
f ∗ (vm(n−4)+1 ) ≡ 2mn + 14m + 2, a unique value to each pixel belonging to the same region of
the connected pixels. The results can be obtained and these
f ∗ (vm(n−2)+1 ) ≡ 2mn + 6m + 2.
are different.
(n−1) (n−3)
The labels of the rest vertices of the circles Cm ,Cm ,. . ., 3.Security labels convey information used by protocol enti-
(4) (2)
Cm , Cm mod 4mn are as follows: ties to determine how to handle data communicated between
open systems. Information on a security label has been used to
f ∗ (v(k−1)m+i+1 ) ≡ 2mn − 4km + 8i + 2, control access, specified protective measures, and determined
1 ≤ i ≤ m − 1, 2 ≤ k ≤ n − 1, k is even. additional handling restrictions required by a communica-
tions security policy.
That is in case n ≡ 1 mod 4
4. Labeling of graphs is used in communication network
f ∗ (vm+i+1 ) ≡ 2mn − 8m + 8i + 2, addressing.
f ∗ (v3m+i+1 ) ≡ 2mn − 16m + 8i + 2, . . . , 5. Labeled graph interpretations also apply to other areas of
∗ mathematics. Some of the most significant numerical results
f (vm( n−7 )+i+1 ) ≡ 10m + 8i + 2, have resulted from the correspondence between some ruler
2
f ∗ (vm( n−3 )+i+1 ) ≡ 2m + 8i + 2, problems in additive number theory and numbered graphs.
2
6. The design of some important good non periodic codes
f ∗ (vm( n+1 )+i+1 ) ≡ 4mn − 6m + 8i + 2, . . . ,
2 for pulse radar and missile guidance is equivalent to number-
f ∗ (vm(n−2)+i+1 ) ≡ 2mn + 4m + 8i + 2, 1 ≤ i ≤ m − 1, ing the complete graph in such a way that all the edge num-
bers are distinct. The node numbers then determine the time
and in case n ≡ 3 mod 4, we have
positions at which the pulses are transmitted. Corresponding
f ∗ (vm+i+1 ) ≡ 2mn − 8m + 8i + 2, radar pulse and missile guidance code problem have been the
f ∗ (v3m+i+1 ) ≡ 2mn − 16m + 8i + 2, . . . , subject of investigation for several years.
7. Labeled graphs are used to construct the polygons of
f ∗ (vm( n−5 )+i+1 ) ≡ 6m + 8i + 2,
2 same internal angles and distinct sides.
f ∗ (vm( n−1 )+i+1 ) ≡ 4mn − 2m + 8i + 2, 8. Qualitative labeling of graph elements have inspired
2
f ∗ (vm( n+3 )+i+1 ) ≡ 4mn − 10m + 8i + 2, . . . , research in diverse fields of human enquiry such as Conflict
2 resolution in social psychology], electrical circuit theory and
f ∗ (vm(n−2)+i+1 ) ≡ 2mn + 4m + 8i + 2, 1 ≤ i ≤ m − 1. energy crisis etc,..
The labels of vertices of the outer circle Cmn mod 4mn are as 9. Graph labeling have also been applied, in determining
follows: ambiguities Crystal structure from X-ray diffraction data has
long been a concern of crystallographers. The ambiguities
f ∗ (vm(n−1)+1 ) ≡ 4mn − 2m + 2, inherent in this procedure are now being understood.
f ∗ (vm(n−1)+i+1 ) ≡ 4mn − 4m + 8i + 2,
≤ i ≤ m − 1. 1 ≤ i ≤ m − 1. V. CONCLUSION
Graceful labeling and edge gracefulness have been studied for
Illustration: The edge odd graceful labeling of the graphs over four decades and these topics continue to be a fascinating
T9,8 , T10,8 , T9,6 , T10,6 , T8,7 , T10,7 , T12,7 , T14,7 , T7,9 and T9,7 one in the world of graph theory and discrete mathematics.
are shown in Fig.11 respectively. An abundance of published papers and results exist, yet
various unsolved problems and unproved conjectures make
IV. APPLICATIONS more research in it. In this work we studied the edge odd
Labeled graphs are becoming an increasingly useful family gracefulness of cylinder and torus grid graphs. In future work
of Mathematical Models for a broad range of applications, we will study the necessary and sufficient conditions for the
also networks representation plays an important role in many rectangular grid graph Pm × Pn to be edge odd graceful.
domains of computer science, ranging from data structures
and graph algorithms, to parallel and distributed computing, REFERENCES
and communication networks:
[1] A. Rosa, ‘‘On certain valuations of the vertices of a graph,’’ in Proc. Int.
In the following we Below we will mention some applica- Symp. Theory Graphs, Rome, Italy, Jul. 1966, pp. 349–355.
tions on graph labeling [9]–[21]. [2] S. W. Golomb, ‘‘How to number a graph,’’ in Graph Theory and Comput-
1. Graph labeling plays a vital role by using graph labeling; ing, R. C. Read, Ed. New York, NY, USA: Academic, 1972, pp. 23–37.
[3] R. B. Gnanajothi, ‘‘Topics in graph theory,’’ Ph.D. Thesis, Madurai Kama-
we can easily understand the graph Structure mining or struc- raj Univ., Madurai, India, 1991.
tured data mining is the process of finding and extracting [4] S.-P. Lo, ‘‘On edge-graceful labelings of graphs,’’ in Proc. Congr. Numer.,
useful information from semi structured sets of data. Graph vol. 50, 1985, pp. 231–241.

VOLUME 7, 2019 10591

 S. N. Daoud: Edge Odd Graceful Labeling of Cylinder and Torus Grid Graphs

[5] S.-M. Lee, ‘‘New directions in the theory of edge-graceful graphs,’’ in [16] G. Chartrand, D. Erwin, F. Harary, and P. Zang, ‘‘Radio labelings of
Proc. 6th Caribbean Conf. Combin. Comput., 1991, pp. 216–231. graphs,’’ Bull. Inst. Combinat. Appl., vol. 33, pp. 77–85, Sep. 2001.
[6] A. Solairaju and K. Chithra, ‘‘Edge-odd graceful graphs,’’ Electron. Notes [17] I. F. Akyildiz, Y.-B. Lin, W.-R. Lai, and R.-J. Chen, ‘‘A new random walk
Discrete Math., vol. 33, pp. 15–20, Apr. 2009. model for PCS networks,’’ IEEE J. Sel. Areas Commun., vol. 18, no. 7,
[7] S. N. Daoud, ‘‘Edge odd graceful labeling of some path and cycle related pp. 1254–1260, Jul. 2000.
graphs,’’ AKCE Int. J. Graphs Combinat., vol. 14, no. 2, pp. 178–203, 2017. [18] J. Li, H. Kameda, and K. Li, ‘‘Optimal dynamic mobility management
[8] J. A. Gallian, ‘‘A dynamic survey of graph labeling,’’ Electron. J. Combi- for PCS networks,’’ IEEE/ACM Trans. Netw., vol. 8, no. 3, pp. 319–327,
nat., vol. 22, pp. 1–432, Dec. 2017. Jun. 2000.
[9] G. S. Bloom and S. W. Golomb, ‘‘Applications of numbered undirected [19] L. Zheng and A. C. Myers, ‘‘Dynamic security labels and noninter-
graphs,’’ Proc. IEEE, vol. 65, no. 4, pp. 562–570, Apr. 1977. ference,’’ Dept. Comput. Inf. Sci., Cornell Univ., Ithaca, NY, USA,
[10] G. S. Bloom and S. W. Golomb, ‘‘Numbered complete graphs, unusual Tech. Rep. 2004-1924, 2004.
rulers, and assorted applications,’’ in Theory and Applications of Graphs [20] K. Eshghi and P. Azimi, ‘‘Applications of mathematical programming in
(Lecture Notes in Mathematics), vol. 642. New York, NY, USA: graceful labeling of graphs,’’ J. Appl. Math., vol. 2004, no. 1, pp. 1–8, 2004.
Springer-Verlag, 1978, pp. 53–65.
[11] M. Sutton, ‘‘Summable graph labellings and their applications,’’
Ph.D. dissertation, Dept. Comput. Sci., Univ. Newcastle, Newcastle upon
Tyne, U.K., 2001. S. N. DAOUD received the B.S., M.Sc., and Ph.D.
[12] R. Dorne and J.-K. Hao, ‘‘Constraint handling in evolutionary search: degrees in pure mathematics from the Faculty
A case study of the frequency assignment,’’ in Parallel Problem Solving of Science, Menoufia University, Egypt, in 1996,
From Nature (Lecture Notes in Computer Science), vol. 1141. Springer, 2002, and 2006, respectively. He is currently with
1996, pp. 801–810.
the Science College, Taibah University, Saudi
[13] I. F. Akyildiz, J. S. M. Ho, and Y.-B. Lin, ‘‘Movement-based location
update and selective paging for PCS networks,’’ IEEE/ACM Trans. Netw.,
Arabia, as a Visitor. He is also an Associate Pro-
vol. 4, no. 4, pp. 629–638, Aug. 1996. fessor with the Department of Mathematics and
[14] A. Abutaleb and V. O. K. Li, ‘‘Location update optimization in personal Computer Science, Faculty of Science, Menoufia
communication systems,’’ Wireless Netw., vol. 3, no. 3, pp. 205–216, 1997. University. His research interests include graph
[15] H. Jung and O. K. Tonguz, ‘‘Random spacing channel assignment to reduce theory, number of spanning trees, graph labeling,
the nonlinear intermodulation distortion in cellular mobile communica- and topological graph theory.
tions,’’ IEEE Trans. Veh. Technol., vol. 48, no. 5, pp. 1666–1675, Sep. 1999.

10592 VOLUME 7, 2019