期刊名称：AKCE International Journal of Graphs and Combinatorics
印刷版ISSN：0972-8600
出版年度：2019
卷号：16
期号：2
页码：213-221
DOI：10.1016/j.akcej.2017.12.002
语种：English
出版社：Elsevier
摘要：AbstractFor a simple graphG=(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 vertexv, assigns the labelχ(e1)⋅χ(e2)⋅⋯⋅χ(en)((modk)),wheree1,e2,…,enare the edges incident to the vertexv. The labelingχis called ak-total edge product cordial labeling ofGif|(eχ(i)+vχ∗(i))−(eχ(j)+vχ∗(j))|≤1for everyi,j,0≤i
