201. Edge Even Graceful Labeling of Polar Grid Graphs
- Author
-
Salama Nagy Daoud
- Subjects
polar grid graph ,Simple graph ,Physics and Astronomy (miscellaneous) ,lcsh:Mathematics ,graceful labeling ,General Mathematics ,010102 general mathematics ,Edge-graceful labeling ,0102 computer and information sciences ,lcsh:QA1-939 ,01 natural sciences ,Graph ,edge graceful labeling ,Vertex (geometry) ,Combinatorics ,Polar grid ,010201 computation theory & mathematics ,Chemistry (miscellaneous) ,Graceful labeling ,Computer Science (miscellaneous) ,Bijection ,edge even graceful labeling ,0101 mathematics ,MathematicsofComputing_DISCRETEMATHEMATICS ,Mathematics - Abstract
Edge Even Graceful Labelingwas first defined byElsonbaty and Daoud in 2017. An edge even graceful labeling of a simple graph G with p vertices and q edges is a bijection f from the edges of the graph to the set { 2 , 4 , … , 2 q } such that, when each vertex is assigned the sum of all edges incident to it mod 2 r where r = max { p , q } , 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.
- Published
- 2019