Antimagicness of Lexicographic Product Graph G[Pn]  

作　　者：Ying-yu LU Guang-hua DONG Ning WANG 

机构地区：[1]School of Mathematical Sciences,Tiangong University,Tianjin 300387,China [2]Lushan College of Guangxi University of Science and Technology,Liuzhou 545000,China [3]Department of Information Science and Technology,Tianjin University of Finance and Economics,Tianjin 300222,China

出　　处：《Acta Mathematicae Applicatae Sinica》2020年第3期603-619,共17页应用数学学报（英文版）

基　　金：supported by the National Natural Science Foundation of China (Nos. 11401430)

摘　　要：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.

关 键 词：antimagic LABELING lexicographic product 

分 类 号：O157.5[理学—数学]