3-total edge product cordial labeling of rhombic grid
For a simple graph , this paper deals with the existence of an edge labeling , which induces a vertex labeling in such a way that for each vertex , assigns the label where are the edges incident to the vertex . The labeling is called a -total edge product cordial labeling of if for every , where and...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2019-08-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2017.12.002 |
| Summary: | For a simple graph , this paper deals with the existence of an edge labeling , which induces a vertex labeling in such a way that for each vertex , assigns the label where are the edges incident to the vertex . The labeling is called a -total edge product cordial labeling of if for every , where and are the number of edges and vertices with and , respectively. In this paper, we examine the existence of such labeling for rhombic grid graph. |
|---|---|
| ISSN: | 0972-8600 |