论文部分内容阅读
For a graph G=(V(G),E(G)),an edge labeling function φ:E(G)→ {0,1,...,k-1} where k is an integer,2≤k≤ |E(G)|,induces a vertex labeling function φ* : V(G)→{0,1,...,k-1} such that φ* is the product of the labels of the edges incident to v(mod k).This function φ is called k-total edge product cordial labeling of G if |(vφ(i)+eφ(i))-vφ(j)+eφ(j))| ≤ 1 for all i,j ∈ {0,1,...,k-1}.