Edge Even Graceful Labeling of Polar Grid Graphs
Edge Even Graceful Labelingwas first defined byElsonbaty and Daoud in 2017. An edge even graceful labeling of a simple graph with vertices and 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 where , the resulting...
Main Author: | Salama Nagy Daoud |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2019-01-01
|
Series: | Symmetry |
Subjects: | |
Online Access: | http://www.mdpi.com/2073-8994/11/1/38 |
Similar Items
-
Edge Even Graceful Labeling of Cylinder Grid Graph
by: Ahmed A. Elsonbaty, et al.
Published: (2019-04-01) -
Edge Odd Graceful Labeling of Cylinder and Torus Grid Graphs
by: S. N. Daoud
Published: (2019-01-01) -
Edge even graceful labelling of some book graphs
by: S.N. Daoud, et al.
Published: (2018-05-01) -
Edge even graceful labelling of new families of graphs
by: S. N. Daoud, et al.
Published: (2019-12-01) -
Tight super-edge-graceful labelings of trees and their applications
by: Alex Collins, et al.
Published: (2015-11-01)