3-total edge product cordial labeling of rhombic grid
For a simple graph G=(V(G),E(G)), this paper deals with the existence of an edge labeling χ:E(G)→{0,1,…,k−1},2≤k≤|E(G)|, which induces a vertex labeling χ∗:V(G)→{0,1,…,k−1}in such a way that for each vertex v, assigns the label χ(e1)⋅χ(e2)⋅⋯⋅χ(en)((modk)), where e1,e2,…,enare the edges incident to t...
| Váldodahkkit: | , |
|---|---|
| Materiálatiipa: | Artihkal |
| Giella: | English |
| Almmustuhtton: |
Taylor & Francis Group
2019-08-01
|
| Ráidu: | AKCE International Journal of Graphs and Combinatorics |
| Liŋkkat: | http://www.sciencedirect.com/science/article/pii/S0972860017302323 |