期刊名称：AKCE International Journal of Graphs and Combinatorics
印刷版ISSN：0972-8600
出版年度：2019
卷号：16
期号：3
页码：310-318
DOI：10.1016/j.akcej.2018.09.001
语种：English
出版社：Elsevier
摘要：AbstractFor a simple graphG=(V,E)with the vertex setVand the edge setEand for an integerk,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), wheree1,e2,…,enare the edges incident to the vertexv. The functionφis called ak-total edge product cordial labeling ofGif|(eφ(i)+vφ∗(i))−(eφ(j)+vφ∗(j))|≤1for everyi,j,0≤i
