Hartsfield and Ringel conjectured that every connected graph other than K2 is antimagic. Since then, many classes of graphs have been proved to be antimagic. But few is known about the antimagicness of lexicographic product graphs. In this paper, via the construction of a directed Eulerian circuit, the Siamese method, and some modification on graph labeling, the antimagicness of lexicographic product graph G[Pn] is obtained.

中文翻译：

---

字典积图 G[Pn] 的反幻性

Hartsfield 和 Ringel 推测除了 K2 之外的所有连通图都是反魔法的。从那时起，许多类别的图都被证明是反魔法的。但很少有人知道字典产品图的反魔法。本文通过构造有向欧拉电路、Siamese 方法以及对图标记的一些修改，得到了字典积图 G[Pn] 的反幻性。