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: | Rizwan Ullah, Gul Rahmat, Muhammad Numan, Kraidi Anoh Yannick, Adnan Aslam |
---|---|
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!
|
Similar Items
-
Total Product and Total Edge Product Cordial Labelings of Dragonfly Graph Dgn
by: N. Inayah, et al.
Published: (2022-01-01) -
Cordial and Total Cordial Labeling of Corona Product of Paths and Second Order of Lemniscate Graphs
by: Ashraf ELrokh, et al.
Published: (2022-01-01) -
A study on the varieties of equivalent cordial labeling graphs
by: M. E. Abdel-Aal, et al.
Published: (2024-12-01) -
Super H-Antimagic Total Covering for Generalized Antiprism and Toroidal Octagonal Map
by: Amir Taimur, et al.
Published: (2021-01-01) -
An Algorithm to Compute the H-Bases for Ideals of Subalgebras
by: Rabia, et al.
Published: (2021-01-01)