Edge even graceful labelling of new families of graphs
Elsonbaty and Daoud introduced a new type of labelling of a graph G with p vertices and q edges called an edge even graceful labelling. A graph G is called edge even graceful if there is a bijection $f: E(G) \rightarrow \{2, 4,\ldots , 2q\} $ such that, when each vertex is assigned the sum of all ed...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2019-12-01
|
| Series: | Journal of Taibah University for Science |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1080/16583655.2019.1611180 |
| id |
doaj-07fb8d923af8484e94fab633399cfb2e |
|---|---|
| record_format |
Article |
| spelling |
doaj-07fb8d923af8484e94fab633399cfb2e2020-11-25T01:13:35ZengTaylor & Francis GroupJournal of Taibah University for Science1658-36552019-12-0113157959110.1080/16583655.2019.16111801611180Edge even graceful labelling of new families of graphsS. N. Daoud0Ahmed N. Elsawy1Taibah UniversityTaibah UniversityElsonbaty and Daoud introduced a new type of labelling of a graph G with p vertices and q edges called an edge even graceful labelling. A graph G is called edge even graceful if there is a bijection $f: E(G) \rightarrow \{2, 4,\ldots , 2q\} $ such that, when each vertex is assigned the sum of all edges incident to it mod $2k $, where $k = \max (p,q ) $, the resulting vertex labels are distinct. In this paper we proved that double fan graphs, quadrilateral friendship graphs, and butterfly graphs are edge even graceful graphs.http://dx.doi.org/10.1080/16583655.2019.1611180edge even graceful labellingdouble fan graphfriendship graphbutterfly graph |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
S. N. Daoud Ahmed N. Elsawy |
| spellingShingle |
S. N. Daoud Ahmed N. Elsawy Edge even graceful labelling of new families of graphs Journal of Taibah University for Science edge even graceful labelling double fan graph friendship graph butterfly graph |
| author_facet |
S. N. Daoud Ahmed N. Elsawy |
| author_sort |
S. N. Daoud |
| title |
Edge even graceful labelling of new families of graphs |
| title_short |
Edge even graceful labelling of new families of graphs |
| title_full |
Edge even graceful labelling of new families of graphs |
| title_fullStr |
Edge even graceful labelling of new families of graphs |
| title_full_unstemmed |
Edge even graceful labelling of new families of graphs |
| title_sort |
edge even graceful labelling of new families of graphs |
| publisher |
Taylor & Francis Group |
| series |
Journal of Taibah University for Science |
| issn |
1658-3655 |
| publishDate |
2019-12-01 |
| description |
Elsonbaty and Daoud introduced a new type of labelling of a graph G with p vertices and q edges called an edge even graceful labelling. A graph G is called edge even graceful if there is a bijection $f: E(G) \rightarrow \{2, 4,\ldots , 2q\} $ such that, when each vertex is assigned the sum of all edges incident to it mod $2k $, where $k = \max (p,q ) $, the resulting vertex labels are distinct. In this paper we proved that double fan graphs, quadrilateral friendship graphs, and butterfly graphs are edge even graceful graphs. |
| topic |
edge even graceful labelling double fan graph friendship graph butterfly graph |
| url |
http://dx.doi.org/10.1080/16583655.2019.1611180 |
| work_keys_str_mv |
AT sndaoud edgeevengracefullabellingofnewfamiliesofgraphs AT ahmednelsawy edgeevengracefullabellingofnewfamiliesofgraphs |
| _version_ |
1725161400036229120 |