Edge Even Graceful Labeling of Polar Grid Graphs
Department of Mathematics, Faculty of Science, Taibah University, Al-Madinah 41411, Saudi Arabia
Department of Mathematics and Computer Science, Faculty of Science, Menoufia University, Shebin El Kom 32511, Egypt
Received: 6 December 2018 / Revised: 20 December 2018 / Accepted: 23 December 2018 / Published: 2 January 2019
PDF [6172 KB, uploaded 17 January 2019]
Edge Even Graceful Labelingwas first defined byElsonbaty and Daoud in 2017. An edge even graceful labeling of a simple graph
edges is a bijection
from the edges of the graph to the set
such that, when each vertex is assigned the sum of all edges incident to it
, the resulting vertex labels are distinct. In this paper we proved necessary and sufficient conditions for the polar grid graph to be edge even graceful graph.
This is an open access article distributed under the Creative Commons Attribution License
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
Share & Cite This Article
MDPI and ACS Style
Daoud, S.N. Edge Even Graceful Labeling of Polar Grid Graphs. Symmetry 2019, 11, 38.
Daoud SN. Edge Even Graceful Labeling of Polar Grid Graphs. Symmetry. 2019; 11(1):38.
Daoud, Salama N. 2019. "Edge Even Graceful Labeling of Polar Grid Graphs." Symmetry 11, no. 1: 38.
Show more citation formats
Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.
[Return to top]
For more information on the journal statistics, click here
Multiple requests from the same IP address are counted as one view.