期刊名称：AKCE International Journal of Graphs and Combinatorics
印刷版ISSN：0972-8600
出版年度：2018
卷号：15
期号：3
页码：271-283
DOI：10.1016/j.akcej.2017.10.005
语种：English
出版社：Elsevier
摘要：AbstractA graph withqedges is calledantimagicif its edges can be labeled with 1, 2,…,qsuch that the sums of the labels on the edges incident to each vertex are distinct. Hartsfield and Ringel conjectured that every connected graph other thanK2is antimagic. In this paper, through a labeling method and a modification on this labeling, we obtained that the lexicographic product graphsPm[Pn]are antimagic.
