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: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2019-01-01
|
| Series: | Symmetry |
| Subjects: | |
| Online Access: | http://www.mdpi.com/2073-8994/11/1/38 |
| id |
doaj-1b24a76788d9400b9e741ddb3bc1e8b1 |
|---|---|
| record_format |
Article |
| spelling |
doaj-1b24a76788d9400b9e741ddb3bc1e8b12020-11-25T00:17:17ZengMDPI AGSymmetry2073-89942019-01-011113810.3390/sym11010038sym11010038Edge Even Graceful Labeling of Polar Grid GraphsSalama Nagy Daoud0Department of Mathematics, Faculty of Science, Taibah University, Al-Madinah 41411, Saudi ArabiaEdge 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 vertex labels are distinct. In this paper we proved necessary and sufficient conditions for the polar grid graph to be edge even graceful graph.http://www.mdpi.com/2073-8994/11/1/38graceful labelingedge graceful labelingedge even graceful labelingpolar grid graph |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Salama Nagy Daoud |
| spellingShingle |
Salama Nagy Daoud Edge Even Graceful Labeling of Polar Grid Graphs Symmetry graceful labeling edge graceful labeling edge even graceful labeling polar grid graph |
| author_facet |
Salama Nagy Daoud |
| author_sort |
Salama Nagy Daoud |
| title |
Edge Even Graceful Labeling of Polar Grid Graphs |
| title_short |
Edge Even Graceful Labeling of Polar Grid Graphs |
| title_full |
Edge Even Graceful Labeling of Polar Grid Graphs |
| title_fullStr |
Edge Even Graceful Labeling of Polar Grid Graphs |
| title_full_unstemmed |
Edge Even Graceful Labeling of Polar Grid Graphs |
| title_sort |
edge even graceful labeling of polar grid graphs |
| publisher |
MDPI AG |
| series |
Symmetry |
| issn |
2073-8994 |
| publishDate |
2019-01-01 |
| description |
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 vertex labels are distinct. In this paper we proved necessary and sufficient conditions for the polar grid graph to be edge even graceful graph. |
| topic |
graceful labeling edge graceful labeling edge even graceful labeling polar grid graph |
| url |
http://www.mdpi.com/2073-8994/11/1/38 |
| work_keys_str_mv |
AT salamanagydaoud edgeevengracefullabelingofpolargridgraphs |
| _version_ |
1725379868659548160 |