Extending of Edge Even Graceful Labeling of Graphs to Strong r-Edge Even Graceful Labeling

Mohamed R. Zeen El Deen, Nora A. Omar and Antonio Di Crescenzo

Journal of Mathematics, 2021, vol. 2021, 1-19

Abstract: Edge even graceful labeling of a graph G with p vertices and q edges is a bijective f from the set of edge EG to the set of positive integers 2,4,…,2q such that all the vertex labels f∗VG, given by f∗u=∑uv∈EGfuvmod2k, where k=maxp,q, are pairwise distinct. There are many graphs that do not have edge even graceful labeling, so in this paper, we have extended the definition of edge even graceful labeling to r-edge even graceful labeling and strong r-edge even graceful labeling. We have obtained the necessary conditions for more path-related graphs and cycle-related graphs to be an r-edge even graceful graph. Furthermore, the minimum number r for which the graphs: tortoise graph, double star graph, ladder and diagonal ladder graphs, helm graph, crown graph, sunflower graph, and sunflower planar graph, have an r-edge even graceful labeling was found. Finally, we proved that the even cycle C2n has a strong 2-edge even graceful labeling when n is even.

Date: 2021
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2021/6643173.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2021/6643173.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:6643173

DOI: 10.1155/2021/6643173

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().