3-Total Edge Product Cordial Labeling for Stellation of Square Grid Graph
Let G be a simple graph with vertex set VG and edge set EG. An edge labeling δ:EG⟶0,1,…,p−1, where p is an integer, 1≤p≤EG, induces a vertex labeling δ∗:VH⟶0,1,…,p−1 defined by δ∗v=δe1δe2⋅δenmodp, where e1,e2,…,en are edges incident to v. The labeling δ is said to be p-total edge product cordial (TE...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2021/1724687 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832546009849266176 |
|---|---|
| author | Rizwan Ullah Gul Rahmat Muhammad Numan Kraidi Anoh Yannick Adnan Aslam |
| author_facet | Rizwan Ullah Gul Rahmat Muhammad Numan Kraidi Anoh Yannick Adnan Aslam |
| author_sort | Rizwan Ullah |
| collection | DOAJ |
| description | Let G be a simple graph with vertex set VG and edge set EG. An edge labeling δ:EG⟶0,1,…,p−1, where p is an integer, 1≤p≤EG, induces a vertex labeling δ∗:VH⟶0,1,…,p−1 defined by δ∗v=δe1δe2⋅δenmodp, where e1,e2,…,en are edges incident to v. The labeling δ is said to be p-total edge product cordial (TEPC) labeling of G if eδi+vδ∗i−eδj+vδ∗j≤1 for every i,j, 0≤i≤j≤p−1, where eδi and vδ∗i are numbers of edges and vertices labeled with integer i, respectively. In this paper, we have proved that the stellation of square grid graph admits a 3-total edge product cordial labeling. |
| format | Article |
| id | doaj-art-b416876c19d941aab945c205681e3dd9 |
| institution | Kabale University |
| issn | 2314-4785 |
| language | English |
| publishDate | 2021-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Mathematics |
| spelling | doaj-art-b416876c19d941aab945c205681e3dd92025-02-03T07:24:13ZengWileyJournal of Mathematics2314-47852021-01-01202110.1155/2021/17246873-Total Edge Product Cordial Labeling for Stellation of Square Grid GraphRizwan Ullah0Gul Rahmat1Muhammad Numan2Kraidi Anoh Yannick3Adnan Aslam4Department of MathematicsDepartment of MathematicsDepartment of MathematicsUFR of Mathematics and Computer ScienceDepartment of Natural Sciences and HumanitiesLet G be a simple graph with vertex set VG and edge set EG. An edge labeling δ:EG⟶0,1,…,p−1, where p is an integer, 1≤p≤EG, induces a vertex labeling δ∗:VH⟶0,1,…,p−1 defined by δ∗v=δe1δe2⋅δenmodp, where e1,e2,…,en are edges incident to v. The labeling δ is said to be p-total edge product cordial (TEPC) labeling of G if eδi+vδ∗i−eδj+vδ∗j≤1 for every i,j, 0≤i≤j≤p−1, where eδi and vδ∗i are numbers of edges and vertices labeled with integer i, respectively. In this paper, we have proved that the stellation of square grid graph admits a 3-total edge product cordial labeling.http://dx.doi.org/10.1155/2021/1724687 |
| spellingShingle | Rizwan Ullah Gul Rahmat Muhammad Numan Kraidi Anoh Yannick Adnan Aslam 3-Total Edge Product Cordial Labeling for Stellation of Square Grid Graph Journal of Mathematics |
| title | 3-Total Edge Product Cordial Labeling for Stellation of Square Grid Graph |
| title_full | 3-Total Edge Product Cordial Labeling for Stellation of Square Grid Graph |
| title_fullStr | 3-Total Edge Product Cordial Labeling for Stellation of Square Grid Graph |
| title_full_unstemmed | 3-Total Edge Product Cordial Labeling for Stellation of Square Grid Graph |
| title_short | 3-Total Edge Product Cordial Labeling for Stellation of Square Grid Graph |
| title_sort | 3 total edge product cordial labeling for stellation of square grid graph |
| url | http://dx.doi.org/10.1155/2021/1724687 |
| work_keys_str_mv | AT rizwanullah 3totaledgeproductcordiallabelingforstellationofsquaregridgraph AT gulrahmat 3totaledgeproductcordiallabelingforstellationofsquaregridgraph AT muhammadnuman 3totaledgeproductcordiallabelingforstellationofsquaregridgraph AT kraidianohyannick 3totaledgeproductcordiallabelingforstellationofsquaregridgraph AT adnanaslam 3totaledgeproductcordiallabelingforstellationofsquaregridgraph |