Edge Odd Graceful Labeling of Cylinder and Torus Grid Graphs

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...

Full description

Bibliographic Details
Main Author:	S. N. Daoud
Format:	Article
Language:	English
Published:	IEEE 2019-01-01
Series:	IEEE Access
Subjects:	Graceful labeling edge odd graceful labeling cylinder grid graph torus grid graph
Online Access:	https://ieeexplore.ieee.org/document/8587242/

id	doaj-1fca9a7691fb4481b86eaedea50919d9
record_format	Article
spelling	doaj-1fca9a7691fb4481b86eaedea50919d92021-03-29T22:47:33ZengIEEEIEEE Access2169-35362019-01-017105681059210.1109/ACCESS.2018.28892938587242Edge Odd Graceful Labeling of Cylinder and Torus Grid GraphsS. N. Daoud0https://orcid.org/0000-0003-3809-2521Department of Mathematics, Faculty of Science, Taibah University, Al-Madinah Al-Munawwarah, Saudi ArabiaSolairaju 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 C<sub>m,n</sub> = P<sub>m</sub> × C<sub>n</sub> and torus grid graph T<sub>m,n</sub> = C<sub>m</sub> × C<sub>n</sub> are edge odd graceful.https://ieeexplore.ieee.org/document/8587242/Graceful labelingedge odd graceful labelingcylinder grid graphtorus grid graph
collection	DOAJ
language	English
format	Article
sources	DOAJ
author	S. N. Daoud
spellingShingle	S. N. Daoud Edge Odd Graceful Labeling of Cylinder and Torus Grid Graphs IEEE Access Graceful labeling edge odd graceful labeling cylinder grid graph torus grid graph
author_facet	S. N. Daoud
author_sort	S. N. Daoud
title	Edge Odd Graceful Labeling of Cylinder and Torus Grid Graphs
title_short	Edge Odd Graceful Labeling of Cylinder and Torus Grid Graphs
title_full	Edge Odd Graceful Labeling of Cylinder and Torus Grid Graphs
title_fullStr	Edge Odd Graceful Labeling of Cylinder and Torus Grid Graphs
title_full_unstemmed	Edge Odd Graceful Labeling of Cylinder and Torus Grid Graphs
title_sort	edge odd graceful labeling of cylinder and torus grid graphs
publisher	IEEE
series	IEEE Access
issn	2169-3536
publishDate	2019-01-01
description	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 C<sub>m,n</sub> = P<sub>m</sub> × C<sub>n</sub> and torus grid graph T<sub>m,n</sub> = C<sub>m</sub> × C<sub>n</sub> are edge odd graceful.
topic	Graceful labeling edge odd graceful labeling cylinder grid graph torus grid graph
url	https://ieeexplore.ieee.org/document/8587242/
work_keys_str_mv	AT sndaoud edgeoddgracefullabelingofcylinderandtorusgridgraphs
_version_	1724190761644195840

Edge Odd Graceful Labeling of Cylinder and Torus Grid Graphs

Similar Items