On 3-total edge product cordial labeling of a carbon nanotube network
For a simple graph G=(V,E)with the vertex set Vand the edge set Eand for an integer k, 2≤k≤|E(G)|, an edge labeling φ:E(G)→{0,1,…,k−1}induces a vertex labeling φ∗:V(G)→{0,1,…,k−1}defined by φ∗(v)=φ(e1)⋅φ(e2)⋅…⋅φ(en)(modk), where e1,e2,…,enare the edges incident to the vertex v. The function φ is cal...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Taylor & Francis Group
2019-12-01
|
Series: | AKCE International Journal of Graphs and Combinatorics |
Online Access: | http://www.sciencedirect.com/science/article/pii/S0972860017301287 |