Edge Even Graceful Labeling of Cylinder Grid Graph
Department of Mathematics, Faculty of Science, Taibah University, Al-Madinah 41411, Saudi Arabia
Department of Mathematics, Faculty of Science, Ain Shams University, Cairo 11566, Egypt
Department of Mathematics and Compuer Science, Faculty of Science, Menoufia University, Shebin El Kom 32511, Egypt
Author to whom correspondence should be addressed.
Received: 26 March 2019 / Revised: 12 April 2019 / Accepted: 14 April 2019 / Published: 22 April 2019
PDF [7472 KB, uploaded 22 April 2019]
Edge even graceful labeling (e.e.g., l.) of graphs is a modular technique of edge labeling of graphs, introduced in 2017. An e.e.g., l. of simple finite undirected graph
is a bijection
, such that when each vertex
is assigned the modular sum of the labels (images of
) of the edges incident to
, the resulting vertex labels are distinct
. In this work, the family of cylinder grid graphs are studied. Explicit formulas of e.e.g., l. for all of the cases of each member of this family have been proven.
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
Elsonbaty, A.A.; Daoud, S.N. Edge Even Graceful Labeling of Cylinder Grid Graph. Symmetry 2019, 11, 584.
Elsonbaty AA, Daoud SN. Edge Even Graceful Labeling of Cylinder Grid Graph. Symmetry. 2019; 11(4):584.
Elsonbaty, Ahmed A.; Daoud, Salama N. 2019. "Edge Even Graceful Labeling of Cylinder Grid Graph." Symmetry 11, no. 4: 584.
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.